# Large Monochromatic Triple Stars in Edge Colourings

@article{Letzter2015LargeMT,
title={Large Monochromatic Triple Stars in Edge Colourings},
author={Shoham Letzter},
journal={Journal of Graph Theory},
year={2015},
volume={80}
}
• Shoham Letzter
• Published 17 October 2013
• Mathematics
• Journal of Graph Theory
Following problems posed by Gyárfás 2011, we show that for every r‐edge‐colouring of Kn there is a monochromatic triple star of order at least n/(r−1) , improving Ruszinkó's result 2012. An edge colouring of a graph is called a local r‐colouring if every vertex spans edges of at most r distinct colours. We prove the existence of a monochromatic triple star with at least rn/(r2−r+1) vertices in every local r‐colouring of Kn .
Large monochromatic components of small diameter
• Mathematics
J. Graph Theory
• 2022
This note improves the result in the case of r = 3 and shows that in every 3-edge-coloring of Kn either there is a monochromatic component of diameter at most three on at least n/2 vertices or every color class is spanning and has diameter at least four.
Covering complete graphs by monochromatically bounded sets
• L. Milicevic
• Mathematics
Applicable Analysis and Discrete Mathematics
• 2019
Given a k-colouring of the edges of the complete graph Kn, are there k-1 monochromatic components that cover its vertices? This important special case of the well-known Lov?sz-Ryser conjecture is
Monochromatic diameter-2 components in edge colorings of the complete graph
• Mathematics
Involve, a Journal of Mathematics
• 2021
Gyarfas conjectured that in every r -edge-coloring of the complete graph K n there is a monochromatic component on at least n ∕ ( r − 1 ) vertices which has diameter at most 3. We show that for r = 3
Improved Monochromatic Double Stars in Edge Colorings
We give a slight improvement on the size of a monochromatic double star we can guarantee in every r -coloring of the edges of $$K_n$$ K n .
Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics
I would like to thank Trinity College and Department of Pure Mathematics and Mathematical Statistics for their generous financial support and hospitality during PhD studies.
Generalizations and Strengthenings of Ryser's Conjecture
• Mathematics
Electron. J. Comb.
• 2021
Ryser's conjecture says that for every $r$-partite hypergraph $H$ with matching number $\nu(H)$, the vertex cover number is at most $(r-1)\nu(H)$.  This far-reaching generalization of König's theorem

## References

SHOWING 1-10 OF 13 REFERENCES
Size of Monochromatic Double Stars in Edge Colorings
• Mathematics
Graphs Comb.
• 2008
It is shown that in every r-coloring of the edges of Kn there is a monochromatic double star with at least n(r+1)+r-1}{r^2+1} vertices, which improves a bound of Mubayi for the largest monochromeatic subgraph of diameter at most three.
Finding Large Monochromatic Diameter Two Subgraphs
Given a coloring of the edges of the complete graph on n vertices in k colors, by considering the neighbors of an arbitrary vertex it follows that there is a monochromatic diameter two subgraph on at
Large components in r‐edge‐colorings of Kn have diameter at most five
It is shown in this note that every r-edge-coloring of Kn contains a monochromatic component of diameter at most five on at least n/(r−1) vertices.
Highly connected monochromatic subgraphs of multicolored graphs
• Mathematics
• 2009
We consider the following question of Bollobas: given an r-coloring of E(Kn), how large a k-connected subgraph can we find using at most s colors? We provide a partial solution to this problem when
Domination in colored complete graphs
• Mathematics
J. Graph Theory
• 1989
There exists X c V(K,) such that 1x1 I t and X monochromatically dominates all but at most n/2’ vertices of K, and X can be constructed by a fast greedy algorithm.
Finding Large p-Colored Diameter Two Subgraphs
• Mathematics
Graphs Comb.
• 1999
It is shown for k≥1 and k\2≤p≤k that there is always a p-colored diameter two subgraph of Kn containing at least vertices and that this is best possible up to an additive constant l satisfying 0≤l.
Large Monochromatic Components in Edge Colorings of Graphs: A Survey
The aim of this survey is to summarize an area of combinatorics that lies on the border of several areas: Ramsey theory, resolvable block designs, factorizations, fractional matchings and coverings,
Generalizing the Ramsey Problem through Diameter
The results include determining $f_1^k(K_n)$, which is equivalent to determining classical Ramsey numbers for multicolorings, and a construction due to Calkin implies that $f-3^k (K-n) \le {{n}\over {k-1}} + k-1$ when $k- 1$ is a prime power.