Maximum cliques in a graph without disjoint given subgraph

DOI10.1016/j.disc.2023.113863arXiv2309.09603OpenAlexW4390597931MaRDI QIDQ6117354

Xiutao Zhu, Fangfang Zhang, Yaojun Chen, Ervin Gyoeri

Publication date: 19 February 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

extremal graphdisjoint uniongeneralized Turán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turán numbers for disjoint copies of graphs
• On the maximum number of five-cycles in a triangle-free graph
• Pentagons vs. triangles
• The maximum number of cliques in graphs without long cycles
• On the number of pentagons in triangle-free graphs
• Some sharp results on the generalized Turán numbers
• Generalized Turán number for linear forests
• On generalized Turán number of two disjoint cliques
• The shifting method and generalized Turán number of matchings
• Generalized Turán problems for disjoint copies of graphs
• Turán Numbers of Multiple Paths and Equibipartite Forests
• On maximal paths and circuits of graphs
• A note on the maximum number of triangles in a C₅‐free graph
• The maximum number of triangles in a graph of given maximum degree
• On Independent Complete Subgraphs in a Graph
• Many \(T\) copies in \(H\)-free graphs
• Generalized Turán results for intersecting cliques
• Triangles in C5‐free graphs and hypergraphs of girth six

This page was built for publication: Maximum cliques in a graph without disjoint given subgraph