Improved monochromatic double stars in edge colorings
From MaRDI portal
Publication:2121489
DOI10.1007/s00373-022-02481-3zbMath1486.05160OpenAlexW4220927149MaRDI QIDQ2121489
Publication date: 4 April 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02481-3
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Connectivity (05C40)
Cites Work
- Size of monochromatic double stars in edge colorings
- Generalized Ramsey theory for graphs, X: Double stars
- Maximum degree and fractional matchings in uniform hypergraphs
- Generalizing the Ramsey problem through diameter
- Large components in r-edge-colorings of Kn have diameter at most five
- Large Monochromatic Triple Stars in Edge Colourings
- Domination in colored complete graphs
- Highly connected monochromatic subgraphs of multicolored graphs
- An algorithmic version of the blow-up lemma
- Unnamed Item