Dense graphs without 3-regular subgraphs
From MaRDI portal
Publication:1892830
DOI10.1006/jctb.1995.1004zbMath0822.05037OpenAlexW2027949178MaRDI QIDQ1892830
Endre Szemerédi, Vojtěch Rödl, László Pyber
Publication date: 2 July 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1995.1004
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)
Related Items (23)
On Even-Degree Subgraphs of Linear Hypergraphs ⋮ Regular subgraphs of uniform hypergraphs ⋮ \(C_4\)-free subgraphs with large average degree ⋮ On graph decompositions modulo \(k\) ⋮ 1-subdivisions, the fractional chromatic number and the Hall ratio ⋮ Two-regular subgraphs of odd-uniform hypergraphs ⋮ Distinct degrees and homogeneous sets ⋮ Small Dense Subgraphs of a Graph ⋮ Resolution of the Erdős–Sauer problem on regular subgraphs ⋮ How to build a pillar: a proof of Thomassen's conjecture ⋮ Nearly-linear monotone paths in edge-ordered graphs ⋮ Triangle-free subgraphs with large fractional chromatic number ⋮ Maximum hypergraphs without regular subgraphs ⋮ A note on Thomassen's conjecture ⋮ Problems and results in extremal combinatorics. II ⋮ Hypergraph containers ⋮ A Note on Degenerate and Spectrally Degenerate Graphs ⋮ An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs ⋮ Spectrally degenerate graphs: hereditary case ⋮ On a conjecture of Thomassen concerning subgraphs of large girth ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Dense Induced Subgraphs of Dense Bipartite Graphs ⋮ Vertex partitions by connected monochromatic \(k\)-regular graphs
This page was built for publication: Dense graphs without 3-regular subgraphs
