2-reachable subsets in two-colored graphs

DOI10.1007/S00373-026-03036-6MaRDI QIDQ7230034zbMATH OpenFDO

Authors András Gyárfás, Gábor N. Sárközy

Publication date 17 April 2026

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00373-026-03036-6

zbMATH Keywords

2-coloring cocktail party graphsdiameter in Ryser's conjecture

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites work

• A bounded diameter strengthening of Kőnig's theorem
• Commuting contractive families
• Covering complete graphs by monochromatically bounded sets
• Finding large \(p\)-colored diameter two subgraphs
• Fruit salad
• Generalizations and strengthenings of Ryser's conjecture
• Graphen und Matrices.
• scientific article; zbMATH DE number 3884213 (Why is no real title available?)
• Low diameter monochromatic covers of complete multipartite graphs
• Ryser's conjecture for tripartite 3-graphs

This page was built for publication: 2-reachable subsets in two-colored graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230034)