Rainbow Saturation and Graph Capacities

DOI10.1137/17M1155429zbMath1388.05069arXiv1711.01047OpenAlexW2963704297MaRDI QIDQ4564887

Dániel Korándi

Publication date: 7 June 2018

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

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

zbMATH Keywords

Shannon capacitycross-intersecting familiesrainbow saturation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

A note on rainbow saturation number of paths ⋮ Rainbow Saturation for Complete Graphs ⋮ Saturation problems in convex geometric hypergraphs ⋮ Rainbow saturation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separating systems and oriented graphs of diameter two
• Minimal oriented graphs of diameter 2
• Capacities: From information theory to extremal set theory
• Sperner capacities
• Colored Saturation Parameters for Rainbow Subgraphs
• A Problem in Graph Theory
• Saturation in random graphs
• Information Theory