Prague dimension of random graphs

DOI10.1007/s00493-023-00016-9arXiv2011.09459MaRDI QIDQ6081403

He Guo, Kalen Patton, Lutz Warnke

Publication date: 4 October 2023

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.09459

zbMATH Keywords

differential equation methodPrague dimensionrandom greedy approachsemi-random approach

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Covering the edges of a random hypergraph by cliques ⋮ On the concentration of the chromatic number of random graphs

This page was built for publication: Prague dimension of random graphs