Cover Image

On the chromatic number of random triangle-free graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mizgerd, Clayton, Perkins, Will, Wang, Yuzhou
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The random graph process is globally synchronizing
by: Jain, Vishesh, et al.
Published: (2025)

Equality in Fill's spectral gap problem
by: Jain, Vishesh, et al.
Published: (2026)

The chromatic number of very dense random graphs
by: Yan, Zhifei
Published: (2024)

Triangle-free $d$-degenerate graphs have small fractional chromatic number
by: Martinsson, Anders
Published: (2025)

The typical structure of dense claw-free graphs
by: Perkins, Will, et al.
Published: (2025)

Lower tails for triangles inside the critical window
by: Jenssen, Matthew, et al.
Published: (2024)

Local central limit theorem for triangle counts in sparse random graphs
by: Araújo, Pedro, et al.
Published: (2023)

Extremal triangle-free graphs with chromatic number at least four
by: Ren, Sijie, et al.
Published: (2024)

Suns in triangle-free graphs of large chromatic number
by: Hajebi, Sepehr, et al.
Published: (2025)

Searching for (sharp) thresholds in random structures: where are we now?
by: Perkins, Will
Published: (2024)

On the concentration of the chromatic number of random graphs
by: Surya, Erlang, et al.
Published: (2022)

The Lovász number of random circulant graphs
by: Bandeira, Afonso S., et al.
Published: (2025)

The clique chromatic number of sparse random graphs
by: Fernandez V, Manuel, et al.
Published: (2024)

On the number of spanning trees in random regular graphs
by: Greenhill, Catherine, et al.
Published: (2013)

Lower bounds for the isoperimetric numbers of random regular graphs
by: Kolesnik, Brett, et al.
Published: (2013)

Sparse random graphs with many triangles
by: Chakraborty, Suman, et al.
Published: (2021)

Moderate deviations of triangle counts in sparse Erdős-Rényi random graphs $G(n,m)$ and $G(n,p)$
by: Alvarado, José D., et al.
Published: (2023)

The chromatic number of triangle-free hypergraphs
by: Li, Lina, et al.
Published: (2022)

Spectral extremal results for triangle-free graphs with chromatic number at least four
by: Zhu, Yinfen, et al.
Published: (2026)

The largest $K_r$-free set of vertices in a random graph
by: Bohman, Tom, et al.
Published: (2026)

On the evolution of structure in triangle-free graphs
by: Jenssen, Matthew, et al.
Published: (2023)

Inducibility of rainbow graphs
by: Cairncross, Emily, et al.
Published: (2024)

A central limit theorem for the matching number of a sparse random graph
by: Glasgow, Margalit, et al.
Published: (2024)

Interlacing triangles, Schubert puzzles, and graph colorings
by: Gaetz, Christian, et al.
Published: (2024)

Eigenvalue gaps of the Laplacian of random graphs
by: Christoffersen, Nicholas, et al.
Published: (2024)

Note on the trace of random walks on pseudorandom graphs
by: Chen, Yaobin, et al.
Published: (2026)

A random walk among random graphs
by: Curien, Nicolas
Published: (2024)

Clique packings in random graphs
by: Griffiths, Simon, et al.
Published: (2024)

Thresholds for colouring the random Borsuk graph
by: Montero, Álvaro Acitores, et al.
Published: (2026)

On the $H$-space of a random graph
by: Dubroff, Quentin, et al.
Published: (2024)

Tree tilings in random regular graphs
by: Diskin, Sahar, et al.
Published: (2024)

Hitting times in the binomial random graph
by: Granet, Bertille, et al.
Published: (2024)

The Moran process on a random graph
by: Frieze, Alan, et al.
Published: (2024)

On the geometry of exponential random graphs and applications
by: Tarkeshian, Mohabat
Published: (2024)

Stability of large cuts in random graphs
by: Hoshen, Ilay, et al.
Published: (2024)

Universality of the matching number in percolated regular graphs
by: Diskin, Sahar, et al.
Published: (2025)

The number of descendants in a preferential attachment graph
by: Janson, Svante, et al.
Published: (2024)

Mixing time and isoperimetry in random geometric graphs
by: Kiwi, Marcos, et al.
Published: (2025)

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

The critical Karp--Sipser core of random graphs
by: Budzinski, Thomas, et al.
Published: (2022)