On the Choice Number of Random Hypergraphs
From MaRDI portal
Publication:2722658
DOI10.1017/S0963548399004095zbMath0982.05092MaRDI QIDQ2722658
Publication date: 29 March 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
large deviations; random graph; balanced graph; density of a subgraph; fractional independence number; sub-gaussian random variable
Related Items
Concentration of non‐Lipschitz functions and applications, Applications of Stein's method for concentration inequalities, Concentration inequalities using the entropy method, Upper tails for subgraph counts in random graphs, Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs, Online balanced graph avoidance games, The missing log in large deviations for triangle counts, Upper tails for triangles, Chasing robbers on random graphs: Zigzag theorem, A concentration result with application to subgraph count