Cover Image

The power of many colours

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alon, Noga, Bucić, Matija, Christoph, Micha, Krivelevich, Michael
Format:	Preprint
Published:	2023
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Essentially tight bounds for rainbow cycles in proper edge-colourings
by: Alon, Noga, et al.
Published: (2023)

Unit and distinct distances in typical norms
by: Alon, Noga, et al.
Published: (2023)

Topological Minors in Typical Lifts
by: Bucić, Matija, et al.
Published: (2024)

On a Ramsey--Turán variant of Roth's theorem
by: Bucić, Matija, et al.
Published: (2025)

Subgraph discrepancies in the complete graph
by: Christoph, Micha, et al.
Published: (2026)

Equiangular lines via improved eigenvalue multiplicity
by: Balla, Igor, et al.
Published: (2024)

Essentially tight bounds for rainbow cycles in proper edge‐colourings
by: Noga Alon, et al.
Published: (2025)

Geometric graphs with exponential chromatic number and arbitrary girth
by: Bucić, Matija, et al.
Published: (2023)

Counting independent sets in structured graphs
by: Bucić, Matija, et al.
Published: (2024)

On a maximal anti-Ramsey conjecture of Burr, Erdős, Graham, and Sós
by: Bucic, Matija, et al.
Published: (2026)

Equivalence between Erdős-Hajnal and polynomial Rödl and Nikiforov conjectures
by: Bucić, Matija, et al.
Published: (2024)

Intersecting hypergraphs with large cover number
by: Bucić, Matija, et al.
Published: (2025)

Induced subgraph density. I. A loglog step towards Erdos-Hajnal
by: Bucić, Matija, et al.
Published: (2023)

Sumsets in the Hypercube
by: Alon, Noga, et al.
Published: (2024)

Erasure codes and Turán hypercube problems
by: Alon, Noga
Published: (2024)

On polynomial degree-boundedness
by: Bourneuf, Romain, et al.
Published: (2023)

On hypercube statistics
by: Alon, Noga, et al.
Published: (2024)

Random Cayley graphs and random sumsets
by: Alon, Noga, et al.
Published: (2025)

Extended VC-dimension, and Radon and Tverberg type theorems for unions of convex sets
by: Alon, Noga, et al.
Published: (2025)

Distinct Directions and Distinct Distances in $\mathbb{R}^d$
by: Alon, Noga, et al.
Published: (2025)

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

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)

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

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

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

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

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

Induced matching treewidth and tree-independence number, revisited
by: Alon, Noga, et al.
Published: (2025)

Partitioning the hypercube into smaller hypercubes
by: Alon, Noga, et al.
Published: (2023)

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

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)

Sums along the edges of bounded degree graphs
by: Alon, Noga, et al.
Published: (2025)

Packing arithmetic progressions
by: Alon, Noga, et al.
Published: (2026)

Maximum shattering
by: Alon, Noga, et al.
Published: (2024)

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

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

Invertibility of digraphs and tournaments
by: Alon, Noga, et al.
Published: (2022)