Extremal graphs without long paths and large cliques

DOI10.1016/J.EJC.2023.103807zbMATH Open1542.05087MaRDI QIDQ6563991FDOQ6563991

Authors: Gyula O. H. Katona, Chuanqi Xiao 

Publication date: 28 June 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Recommendations

• Extremal graphs without long paths and a given graph
• Turán numbers for disjoint paths
• The Turán numbers of special forests
• Connected graphs without long paths
• The Turán number of disjoint copies of paths

zbMATH Keywords

Turán number\(\mathcal{F}\) graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Enumeration in graph theory (05C30) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Cites Work

• On maximal paths and circuits of graphs
• Path Ramsey numbers in multicolorings
• Title not available (Why is that?)
• Connected graphs without long paths
• Eine Extremalaufgabe aus der Graphentheorie.

Cited In (1)

• Extremal graphs without long paths and a given graph

This page was built for publication: Extremal graphs without long paths and large cliques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563991)