Extremal graphs without long paths and large cliques

DOI10.1016/J.EJC.2023.103807MaRDI QIDQ6563991zbMATH OpenFDO

Authors Gyula O. H. Katona, Chuanqi Xiao

Publication date 28 June 2024

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

Full work available at URL https://doi.org/10.1016/J.EJC.2023.103807

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)

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

Cites work

• scientific article; zbMATH DE number 3652374 (Why is no real title available?)
• Connected graphs without long paths
• Eine Extremalaufgabe aus der Graphentheorie.
• On maximal paths and circuits of graphs
• Path Ramsey numbers in multicolorings

Cited in

(8)

• Turán numbers of cycles plus a general graph
• Spectral extremal problems for graphs with bounded clique number
• Spectral extrema of graphs: forbidden linear forests and non-bipartite graphs
• Extremal graphs without long paths and a given graph
• The number of edges in graphs with bounded clique number and circumference
• Many cliques in graphs with bounded matching number and circumference
• Extremal graphs for star forests with bounded clique number
• Generalized Turán problem for a path and a clique

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)