On the Choice Number of Random Hypergraphs
From MaRDI portal
Publication:2722658
DOI10.1017/S0963548399004095zbMath0982.05092OpenAlexW2089062694MaRDI QIDQ2722658
Publication date: 29 March 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548399004095
large deviationsrandom graphbalanced graphdensity of a subgraphfractional independence numbersub-gaussian random variable
Related Items
Upper tails for subgraph counts in random graphs, Concentration of non‐Lipschitz functions and applications, Nonlinear large deviations, The missing log in large deviations for triangle counts, Upper tails for triangles, Large Rainbow Cliques in Randomly Perturbed Dense Graphs, On replica symmetry of large deviations in random graphs, Combinatorial theorems in sparse random sets, Upper tails and independence polynomials in random graphs, Applications of Stein's method for concentration inequalities, Upper tail for homomorphism counts in constrained sparse random graphs, Counting extensions revisited, The upper tail problem for induced 4‐cycles in sparse random graphs, Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs, Nonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphs, Upper Tail Bounds for Cycles, Concentration inequalities using the entropy method, Online balanced graph avoidance games, The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs, On the variational problem for upper tails in sparse random graphs, Chasing robbers on random graphs: Zigzag theorem, The lower tail: Poisson approximation revisited, On the missing log in upper tail estimates, A counterexample to the DeMarco‐Kahn upper tail conjecture, Upper tail bounds for stars, Regular graphs with many triangles are structured, Spanning trees in random graphs, A concentration result with application to subgraph count, On the average-case complexity of parameterized clique, Containment game played on random graphs: another zig-zag theorem, Tight upper tail bounds for cliques
