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.
منابع مشابه
APPROXIMATIONS TO m-COLOURED COMPLETE INFINITE HYPERGRAPHS
Given an edge colouring of a graph with a set of m colours, we say that the graph is (exactly) m-coloured if each of the colours is used. In 1999, Stacey and Weidl, partially resolving a conjecture of Erickson from 1994, showed that for a fixed natural number m > 2 and for all sufficiently large k, there is a k-colouring of the complete graph on N such that no complete infinite subgraph is exac...
متن کاملApproximations to m-Colored Complete Infinite Hypergraphs
Given an edge colouring of a graph with a set of m colours, we say that the graph is (exactly) m-coloured if each of the colours is used. In 1999, Stacey and Weidl, partially resolving a conjecture of Erickson from 1994, showed that for a fixed natural number m > 2 and for all sufficiently large k, there is a k-colouring of the complete graph on N such that no complete infinite subgraph is exac...
متن کاملAPPROXIMATIONS TO m-COLOURED COMPLETE INFINITE SUBGRAPHS
Given an edge colouring of a graph with a set of m colours, we say that the graph is exactly m-coloured if each of the colours is used. In 1996, Stacey and Weidl, partially resolving a conjecture of Erickson from 1994, showed that for a fixed natural number m > 2 and for all sufficiently large k, there is a k-colouring of complete graph on N such that no complete infinite subgraph is exactly m-...
متن کاملLarge Rainbow Matchings in Edge-Coloured Graphs
A rainbow subgraph of an edge-coloured graph is a subgraph whose edges have distinct colours. The colour degree of a vertex v is the number of different colours on edges incident with v. Wang and Li conjectured that for k 4, every edge-coloured graph with minimum colour degree k contains a rainbow matching of size at least k/2 . A properly edge-coloured K4 has no such matching, which motivates ...
متن کاملRamsey Numbers of Connected Clique Matchings
We determine the Ramsey number of a connected clique matching. That is, we show that if G is a 2-edge-coloured complete graph on (r2− r− 1)n− r+ 1 vertices, then there is a monochromatic connected subgraph containing n disjoint copies of Kr for n sufficiently large. This number of vertices cannot be reduced.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012