How many random edges make a dense hypergraph non-2-colorable?
From MaRDI portal
Publication:3503605
DOI10.1002/rsa.25155zbMath1149.05038arXiv0707.0315MaRDI QIDQ3503605
Publication date: 5 June 2008
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0707.0315
05C80: Random graphs (graph-theoretic aspects)
05C65: Hypergraphs
05C15: Coloring of graphs and hypergraphs
Related Items
The Effect of Adding Randomly Weighted Edges, Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers, Small rainbow cliques in randomly perturbed dense graphs, Smoothed Analysis on Connected Graphs
Cites Work