Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs
نویسندگان
چکیده
منابع مشابه
Monochromatic matchings in the shadow graph of almost complete hypergraphs
Edge colorings of r-uniform hypergraphs naturally define a multicoloring on the 2-shadow, i.e. on the pairs that are covered by hyperedges. We show that in any (r− 1)-coloring of the edges of an r-uniform hypergraph with n vertices and at least (1−2)(n r ) edges, the 2-shadow has a monochromatic matching covering all but at most o(n) vertices. This result implies that for any fixed r and suffic...
متن کاملLarge almost monochromatic subsets in hypergraphs
We show that for all l and ǫ > 0 there is a constant c = c(l, ǫ) > 0 such that every l-coloring of the triples of an N -element set contains a subset S of size c √ logN such that at least 1 − ǫ fraction of the triples of S have the same color. This result is tight up to the constant c and answers an open question of Erdős and Hajnal from 1989 on discrepancy in hypergraphs. For l ≥ 4 colors, it ...
متن کاملCovering complete partite hypergraphs by monochromatic components
A well-known special case of a conjecture attributed to Ryser (actually appeared in the thesis of Henderson [7]) states that k-partite intersecting hypergraphs have transversals of at most k−1 vertices. An equivalent form of the conjecture in terms of coloring of complete graphs is formulated in [1]: if the edges of a complete graph K are colored with k colors then the vertex set of K can be co...
متن کاملMonochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
We conjecture that for any fixed r and sufficiently large n, there is a monochromatic Hamiltonian Bergecycle in every (r − 1)-coloring of the edges of K n , the complete r-uniform hypergraph on n vertices. We prove the conjecture for r = 3, n 5 and its asymptotic version for r = 4. For general r we prove weaker forms of the conjecture: there is a Hamiltonian Berge-cycle in (r−1)/2 -colorings of...
متن کاملLarge 2-Coloured Matchings in 3-Coloured Complete Hypergraphs
We prove the generalized Ramsey-type result on large 2-coloured matchings in a 3-coloured complete 3-uniform hypergraph, supporting a conjecture by A. Gyárfás.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2010
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-010-0058-1