An Erdős-Gallai-type theorem for keyrings

DOI10.1007/s00373-018-1901-0zbMath1395.05087arXiv1705.10254OpenAlexW3098414541MaRDI QIDQ2413630

Alexander Sidorenko

Publication date: 14 September 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Sós conjectureErdős-Gallai theorem

Mathematics Subject Classification ID

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

Related Items (1)

Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotic solution for a new class of forbidden r-graphs
• Path Ramsey numbers in multicolorings
• The Erdős-Sós conjecture for spiders
• On maximal paths and circuits of graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4865531 On the Erd�s-S�s conjecture]
• The Erdős‐Sós Conjecture for trees of diameter four

This page was built for publication: An Erdős-Gallai-type theorem for keyrings