Finding Large p-Colored Diameter Two Subgraphs

@article{Erds1999FindingLP,
  title={Finding Large p-Colored Diameter Two Subgraphs},
  author={Paul Erd{\"o}s and Tom Fowler},
  journal={Graphs and Combinatorics},
  year={1999},
  volume={15},
  pages={21-27}
}
Abstract. Given a coloring of the edges of the complete graph K on n vertices in k colors, a p-colored subgraph of Kn is any subgraph whose edges only use colors from some p element set. We show 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 
Monochromatic diameter-2 components in edge colorings of the complete graph
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
Size of Monochromatic Double Stars in Edge Colorings
TLDR
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.
Monochromatic homeomorphically irreducible trees in $2$-edge-colored complete graphs
It has been known that every 2-edge-colored complete graph has a monochromatic connected spanning subgraph. In this paper, we study a condition which can be imposed on such monochromatic subgraph,
Large monochromatic components of small diameter
TLDR
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.
Large components in r‐edge‐colorings of Kn have diameter at most five
TLDR
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.
Ramsey-type results for Gallai colorings
A Gallai-coloring of a complete graph is an edge coloring such that no triangle is colored with three distinct colors. Gallai-colorings occur in various contexts such as the theory of partially
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,
Ramsey‐type results for Gallai colorings
TLDR
It is proved that in every G-coloring of Kn there exists each of the following: a monochromatic double star with at least 3n+1 4 vertices; and RG(r,K3) can be determined exactly.
Rainbow Generalizations of Ramsey Theory - A Dynamic Survey
In this work, we collect Ramsey-type results concerning rainbow edge colorings of graphs. Revision History • Revision 3: March, 2015. • Revision 2: October, 2014. • Revision 1: July, 2011. •
Rainbow Generalizations of Ramsey Theory: A Survey
TLDR
In this work, Ramsey-type results concerning rainbow edge colorings of graphs are collected.
...
1
2
...

References

SHOWING 1-3 OF 3 REFERENCES
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
Intersection Theorems for Systems of Sets
  • J. Spencer
  • Mathematics
    Canadian Mathematical Bulletin
  • 1977
Let n and k be positive integers, k≥3. Denote by ϕ(n, k) the least positive integer such that if F is any family of more than ϕ(n, k) sets, each set with n elements, then some k members of F have
A Partition of two-colored complete graphs
  • Preprint
  • 1996