The rainbow saturation number is linear
From MaRDI portal
Publication:6490280
DOI10.1137/23M1566881MaRDI QIDQ6490280FDOQ6490280
Authors: Natalie C. Behague, Tom Johnston, Shoham Letzter, Natasha Morrison, Shannon Ogden
Publication date: 23 April 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Saturated graphs with minimal number of edges
- A survey of minimum saturated graphs
- A Problem in Graph Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An extremal problem for sets with applications to graph theory
- Title not available (Why is that?)
- Asymptotic results on saturated graphs
- Title not available (Why is that?)
- Edge-colored saturated graphs
- Rainbow saturation
- Rainbow saturation and graph capacities
- Colored saturation parameters for rainbow subgraphs
- On edge-colored saturation problems
- Rainbow saturation of graphs
- Weakly saturated hypergraphs and a conjecture of Tuza
Cited In (1)
This page was built for publication: The rainbow saturation number is linear
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6490280)