The Density Turán Problem

DOI10.1017/S0963548312000016zbMath1247.05113arXiv1407.7873MaRDI QIDQ2908127

Zoltán Lóránt Nagy, Péter Csikvári

Publication date: 4 September 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.7873

zbMATH Keywords

extremal graphstransversaledge densitystar decompositionblow-up graphcritical edge density

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)

Related Items (1)

The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm

Cites Work

• Integral trees of arbitrarily large diameters
• Density conditions for triangles in multipartite graphs
• On complete subgraphs of \(r\)-chromatic graphs
• Independent transversals in \(r\)-partite graphs
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• Theory of monomer-dimer systems
• The minimal density of triangles in tripartite graphs
• Complete Subgraphs of r-partite Graphs

This page was built for publication: The Density Turán Problem