Note on upper density of quasi-random hypergraphs

zbMath1298.05235MaRDI QIDQ396781

Vojtěch Rödl, Vindya Bhat

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p59

zbMATH Keywords

jumpsdensityhypergraphsquasi-random

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Density (toughness, etc.) (05C42)

Related Items (3)

A problem of Erdős and Sós on 3-graphs ⋮ The Erdős-Hajnal hypergraph Ramsey problem ⋮ On the maximum density of fixed strongly connected subtournaments

Cites Work

• Unnamed Item
• A problem of Erdős and Sós on 3-graphs
• On universality of graphs with uniformly distributed edges
• Hypergraphs do not jump
• Uniform edge distribution in hypergraphs is hereditary
• On extremal problems of graphs and generalized graphs
• Random sampling and approximation of MAX-CSP problems
• Flag algebras
• ON THE METHOD OF PAIRED COMPARISONS

This page was built for publication: Note on upper density of quasi-random hypergraphs