Cover Image

Subgraph discrepancies in the complete graph

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Christoph, Micha, Gishboliner, Lior, Krivelevich, Michael
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Steiner triple systems with high discrepancy
by: Gishboliner, Lior, et al.
Published: (2025)

Tight Hamilton cycles with high discrepancy
by: Gishboliner, Lior, et al.
Published: (2023)

Asymmetric results about graph homomorphisms
by: Gishboliner, Lior, et al.
Published: (2025)

Induced subgraphs of $K_r$-free graphs and the Erdős--Rogers problem
by: Gishboliner, Lior, et al.
Published: (2024)

Polynomial removal lemma for ordered matchings
by: Gishboliner, Lior, et al.
Published: (2023)

Disperse Hypergraphs
by: Gishboliner, Lior, et al.
Published: (2025)

Hypergraph removal with polynomial bounds
by: Gishboliner, Lior, et al.
Published: (2022)

The power of many colours
by: Alon, Noga, et al.
Published: (2023)

Set mappings for general graphs
by: Gishboliner, Lior, et al.
Published: (2026)

Polynomial Property Testing
by: Gishboliner, Lior, et al.
Published: (2025)

Canonical Ramsey numbers of sparse graphs
by: Gishboliner, Lior, et al.
Published: (2024)

The Hamilton cycle space of random regular graphs and randomly perturbed graphs
by: Hefetz, Dan, et al.
Published: (2025)

Two Erdos-Hajnal-type theorems for forbidden order-size pairs
by: Arnold, Fabian, et al.
Published: (2024)

An efficient asymmetric removal lemma and its limitations
by: Gishboliner, Lior, et al.
Published: (2023)

Regularity for hypergraphs with bounded VC$_2$ dimension
by: Gishboliner, Lior, et al.
Published: (2025)

Is it easy to regularize a hypergraph with easy links?
by: Gishboliner, Lior, et al.
Published: (2025)

The spanning tree spectrum: improved bounds and simple proofs
by: Alon, Noga, et al.
Published: (2025)

On high discrepancy $1$-factorizations of complete graphs
by: Ai, Jiangdong, et al.
Published: (2025)

The Hamilton cycle space of random graphs
by: Hefetz, Dan, et al.
Published: (2025)

Colouring graphs from random lists
by: Hefetz, Dan, et al.
Published: (2024)

Non-isomorphic subgraphs in random graphs
by: Krivelevich, Michael, et al.
Published: (2025)

Maximum chordal subgraphs of random graphs
by: Krivelevich, Michael, et al.
Published: (2023)

Disjoint connected dominating sets in pseudorandom graphs
by: Draganić, Nemanja, et al.
Published: (2024)

Reconstructing random graphs from distance queries
by: Krivelevich, Michael, et al.
Published: (2024)

Hardness of Hypergraph Edge Modification Problems
by: Gishboliner, Lior, et al.
Published: (2025)

Combinatorial sufficient conditions for graph rigidity and applications to random graphs
by: Krivelevich, Michael, et al.
Published: (2026)

Components, large and small, are as they should be II: supercritical percolation on regular graphs of constant degree
by: Diskin, Sahar, et al.
Published: (2024)

Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree
by: Diskin, Sahar, et al.
Published: (2024)

Multicolor $K_r$-Tilings with High Discrepancy
by: Chan, Henry, et al.
Published: (2026)

Defect and transference versions of the Alon-Frankl-Lovasz theorem
by: Gishboliner, Lior, et al.
Published: (2025)

Bounded-degree spanning trees in randomly perturbed graphs
by: Krivelevich, Michael, et al.
Published: (2015)

A discrepancy dichotomy for 1-factorizations of signed complete bipartite graphs
by: Xue, Yisai, et al.
Published: (2026)

The Hamilton space of pseudorandom graphs
by: Christoph, Micha, et al.
Published: (2024)

A large hole in pseudo-random graphs
by: Diskin, Sahar, et al.
Published: (2025)

Minors in small-set expanders
by: Krivelevich, Michael, et al.
Published: (2025)

Graded discrepancy of graphs and hypergraphs
by: Chen, Yanling, et al.
Published: (2025)

Subgraphs of random graphs in hereditary families
by: Clifton, Alexander, et al.
Published: (2024)

Minimum degree conditions for graph rigidity
by: Krivelevich, Michael, et al.
Published: (2024)

Hitting time of connectedness in the random hypercube process
by: Diskin, Sahar, et al.
Published: (2024)

Largest $2$-regular Subgraphs in complete $S$-partite Graphs
by: Jiang, Yiyang, et al.
Published: (2026)