The Turán number of sparse spanning graphs

DOI10.1016/j.jctb.2013.02.002zbMath1301.05201arXiv1404.1182OpenAlexW2115557450MaRDI QIDQ744159

Raphael Yuster, Noga Alon

Publication date: 6 October 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

maximum vertex degreeDirac-type resultsexact thresholdminimum vertex degreeTurán-type results

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Related Items (6)

On Erdős-Sós conjecture for trees of large size ⋮ On a packing problem of Alon and Yuster ⋮ Packing large trees of consecutive orders ⋮ The Turán number for spanning linear forests ⋮ Unavoidable hypergraphs ⋮ All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight)

Cites Work

• On extremal hypergraphs for Hamiltonian cycles
• Edge disjoint placement of graphs
• Arc coverings of graphs
• Packings of graphs and applications to computational complexity
• Subgraphs of graphs. I
• Hamiltonian chains in hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Turán number of sparse spanning graphs