Cover Image

The dimension of sparse and co-sparse random graph orders

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gao, Pu, Kumar, Arnav
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Prague dimension of sparse random graphs
by: Joos, Felix, et al.
Published: (2025)

Minors of matroids represented by sparse random matrices over finite fields
by: Gao, Pu, et al.
Published: (2023)

First order distinguishability of sparse random graphs
by: Hershko, Tal, et al.
Published: (2024)

A note on the width of sparse random graphs
by: Do, Tuan Anh, et al.
Published: (2022)

Packing and finding paths in sparse random graphs
by: Iršič, Vesna, et al.
Published: (2024)

Canonical labelling of sparse random graphs
by: Verbitsky, Oleg, et al.
Published: (2024)

Twin-width of sparse random graphs
by: Hendrey, Kevin, et al.
Published: (2023)

Structure of lower tails in sparse random graphs
by: Chin, Byron
Published: (2023)

Sharp threshold for Hamilton cycles in randomly perturbed sparse graphs
by: Ma, Guorui, et al.
Published: (2026)

The rank of sparse random matrices
by: Coja-Oghlan, Amin, et al.
Published: (2019)

Induced even cycles in locally sparse graphs
by: Ding, Laihao, et al.
Published: (2024)

Majority dynamics on sparse random graphs
by: Chakraborti, Debsoumya, et al.
Published: (2021)

Coloring locally sparse graphs
by: Anderson, James, et al.
Published: (2024)

Spectra of high-dimensional sparse random geometric graphs
by: Cao, Yifan, et al.
Published: (2025)

Minimum stationary values of sparse random directed graphs
by: Cai, Xing Shi, et al.
Published: (2020)

A remark on the independence number of sparse random Cayley sum graphs
by: Nenadov, Rajko
Published: (2025)

Concentration of the maximum size of an induced subtree in moderately sparse random graphs
by: Oropeza, Juan Carlos Buitrago
Published: (2025)

A note on the chromatic number of the square of a sparse random graph
by: Frieze, Alan, et al.
Published: (2023)

The maximum degree of the $r$th power of a sparse random graph
by: Frieze, Alan, et al.
Published: (2024)

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

On Alon-Tarsi orientations of sparse graphs
by: Cho, Eun-Kyung, et al.
Published: (2025)

On endomorphism universality of sparse graph classes
by: Knauer, Kolja, et al.
Published: (2022)

Blow-up lemmas for sparse graphs
by: Allen, Peter, et al.
Published: (2016)

Equitable coloring of sparse graphs
by: Liu, Weichan, et al.
Published: (2024)

First-order transducibility among classes of sparse graphs
by: Gajarský, Jakub, et al.
Published: (2025)

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

On odd colorings of sparse graphs
by: Wang, Tao, et al.
Published: (2022)

Between proper and square colorings of sparse graphs
by: Choi, Ilkyoo, et al.
Published: (2025)

Embedding induced trees in sparse expanding graphs
by: Girão, António, et al.
Published: (2024)

The law of the circumference of sparse binomial random graphs
by: Anastos, Michael, et al.
Published: (2025)

Approximate packing of independent transversals in locally sparse graphs
by: Chakraborti, Debsoumya, et al.
Published: (2024)

Frugal colourings of graphs via sparse hypergraph colouring
by: Chuet, Quentin
Published: (2026)

Spectral Turán-type problems on sparse spanning graphs
by: Liu, Lele, et al.
Published: (2023)

K_4-free graphs have sparse halves
by: Reiher, Christian
Published: (2021)

Bounds for the independence and chromatic numbers of locally sparse graphs
by: Dhawan, Abhishek
Published: (2024)

Counting sparse induced subgraphs in locally dense graphs
by: Nenadov, Rajko
Published: (2024)

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

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

Strong odd coloring of sparse graphs
by: Kwon, Hyemin, et al.
Published: (2024)

Elementary first-order model checking for sparse graphs
by: Gajarský, Jakub, et al.
Published: (2024)