Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence

DOI10.1007/s10878-008-9174-9zbMath1213.90210OpenAlexW2171859373MaRDI QIDQ965817

Andrzej Ruciński, Andrzej Dudek, Joanna Polcyn

Publication date: 26 April 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-008-9174-9

zbMATH Keywords

random hypergraphsfractional independence

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes, Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs, An analytic approach to sparse hypergraphs: hypergraph removal, The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs, Upper tail bounds for stars, On a Conjecture of Nagy on Extremal Densities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some intersection theorems for ordered sets and graphs
• On the number of subgraphs of prescribed type of graphs with a given number of edges
• On the number of copies of one hypergraph in another
• Upper tails for subgraph counts in random graphs
• Threshold functions for small subgraphs
• Poisson approximation for large deviations