Gaps in the saturation spectrum of trees

DOI10.7151/dmgt.2073zbMath1401.05158OpenAlexW2796783537MaRDI QIDQ1630934

Brent J. Thomas, Ronald J. Gould, Michael S. Jacobson, Paul S. Horn

Publication date: 5 December 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2073

zbMATH Keywords

treesaturation numbersaturation spectrum

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cites Work

• The edge spectrum of the saturation number for small paths
• Asymptotic solution for a new class of forbidden r-graphs
• Size in maximal triangle-free graphs and minimal graphs of diameter 2
• On the non-(p-1)-partite K_{p}-free graphs
• On maximal paths and circuits of graphs
• The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition
• The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs
• The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs
• The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result
• The Erdős‐Sós Conjecture for trees of diameter four
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Gaps in the saturation spectrum of trees