Rainbow Saturation for Complete Graphs
From MaRDI portal
Publication:6130540
DOI10.1137/23m1565875arXiv2212.04640OpenAlexW4392811868MaRDI QIDQ6130540
Kevin Hendrey, Debsoumya Chakraborti, Casey Tompkins, Ben D. Lund
Publication date: 3 April 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.04640
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Extremal combinatorics (05D99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(K_{s,t}\)-saturated bipartite graphs
- A survey of minimum saturated graphs
- An extremal problem for sets with applications to graph theory
- Multicolour Turán problems
- Generalized rainbow Turán problems
- A note on rainbow saturation number of paths
- On edge-colored saturation problems
- Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
- On the non-(p-1)-partite K_{p}-free graphs
- Rainbow Turán Problems
- Saturated graphs with minimal number of edges
- Edge-colored saturated graphs
- Rainbow Saturation and Graph Capacities
- Colored Saturation Parameters for Rainbow Subgraphs
- Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs
- The Generalized Rainbow Turán Problem for Cycles
- Few H copies in F‐saturated graphs
- Rainbow saturation of graphs
- A rainbow version of Mantel's Theorem
- Partite Saturation of Complete Graphs
- Partite Saturation Problems
- A Problem in Graph Theory
- Saturation in random graphs
- Saturated Subgraphs of the Hypercube
- Saturation in the Hypercube and Bootstrap Percolation
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On generalized graphs
- On a problem of K. Zarankiewicz
- Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
- Graph saturation in multipartite graphs
