An Erdős-Gallai type theorem for vertex colored graphs

DOI10.1007/s00373-019-02026-1zbMath1416.05115arXiv1712.04388OpenAlexW2772382996MaRDI QIDQ2000563

Oscar Zamora, Nika Salia, Casey Tompkins

Publication date: 28 June 2019

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

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

zbMATH Keywords

pathscyclestreesvertex coloringextremal

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Cites Work

• 3-uniform hypergraphs avoiding a given odd cycle
• On maximal paths and circuits of graphs
• The Erdős‐Sós Conjecture for trees of diameter four
• Extremal Numbers for Odd Cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Erdős-Gallai type theorem for vertex colored graphs