Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph

DOI10.1016/j.ejc.2020.103185zbMath1458.05111arXiv1907.01603OpenAlexW3042915511MaRDI QIDQ2225397

Po-Shen Loh, Debsoumya Chakraborti

Publication date: 8 February 2021

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

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

zbMATH Keywords

\(F\)-free graphTuran number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items (5)

Weakly saturated hypergraphs and a conjecture of Tuza ⋮ Rainbow Saturation for Complete Graphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs ⋮ Saturation numbers for disjoint stars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The saturation function of complete partite graphs
• A survey of minimum saturated graphs
• Supersaturated graphs and hypergraphs
• Asymptotic results on saturated graphs
• Asymptotic growth of sparse saturated structures is locally determined
• Size in maximal triangle-free graphs and minimal graphs of diameter 2
• What we know and what we do not know about Turán numbers
• On the non-(p-1)-partite K_{p}-free graphs
• Saturated graphs with minimal number of edges
• On complete subgraphs of different orders
• Few H copies in F‐saturated graphs
• A Problem in Graph Theory
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On generalized graphs
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph