Extremal graphs without long paths and a given graph

DOI10.1016/J.DISC.2024.113988MaRDI QIDQ6461737zbMATH OpenFDO

Authors Yichong Liu, Liying Kang

Publication date 1 December 2023

Full work available at URL https://doi.org/10.1016/J.DISC.2024.113988

Mathematics Subject Classification ID

Set theory (03Exx) Enumerative combinatorics (05Axx) Graph theory (05Cxx)

Recommendations

• Extremal graphs without long paths and large cliques
• Connected graphs without long paths
• scientific article; zbMATH DE number 3891406
• On the maximum size of connected hypergraphs without a path of given length
• scientific article; zbMATH DE number 2191994

Cited in

(7)

• Extremal graphs without long paths and large cliques
• The number of edges in graphs with bounded clique number and circumference
• Extremal graphs for star forests with bounded clique number
• Generalized Turán problem for a path and a clique
• Turán numbers of cycles plus a general graph
• Many cliques in graphs with bounded matching number and circumference
• A general theorem in spectral extremal graph theory

This page was built for publication: Extremal graphs without long paths and a given graph

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