On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs

DOI10.37236/8857zbMath1456.05115arXiv1904.07825OpenAlexW3119622246MaRDI QIDQ2223466

Jingmei Zhang, Zi-Xia Song

Publication date: 29 January 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(r\)-coloringgraph bootstrap percolation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Related Items (3)

On the size of \((K_t, K_{1, k})\)-co-critical graphs ⋮ On the size of \((K_t, P_k)\)-co-critical graphs ⋮ On the size of special class 1 graphs and \((P_3;k)\)-co-critical graphs

Cites Work

• Saturation numbers for families of Ramsey-minimal graphs
• A survey of minimum saturated graphs
• Saturation numbers for Ramsey-minimal graphs
• Ramsey-minimal saturation numbers for matchings
• Edge-colored saturated graphs
• A Problem in Graph Theory
• A Theorem on k-Saturated Graphs
• Saturated Graphs of Prescribed Minimum Degree
• On generalized graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs