On the hypercompetition numbers of hypergraphs with maximum degree at most two
نویسنده
چکیده
In this note, we give an easy and short proof for the theorem by Park and Kim stating that the hypercompetition numbers of hypergraphs with maximum degree at most two is at most two.
منابع مشابه
On the hypercompetition numbers of hypergraphs
The competition hypergraph CH(D) of a digraph D is the hypergraph such that the vertex set is the same as D and e ⊆ V (D) is a hyperedge if and only if e contains at least 2 vertices and e coincides with the in-neighborhood of some vertex v in the digraph D. Any hypergraph H with sufficiently many isolated vertices is the competition hypergraph of an acyclic digraph. The hypercompetition number...
متن کامل3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Chvátal, Rödl, Szemerédi and Trotter [1] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hypergraphs. The main new tool which we prove and use is an embedding lemma for 3-uniform hypergraphs of bounded maximum degree into suitable 3-uniform ‘pseudo-random’ hypergraphs. keywords: hypergraphs; regularity lemm...
متن کاملEMBEDDINGS AND RAMSEY NUMBERS OF SPARSE k-UNIFORM HYPERGRAPHS
Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6, 23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...
متن کاملOn Ramsey numbers of uniform hypergraphs with given maximum degree
For every > 0 and every positive integers Δ and r , there exists C = C( ,Δ, r) such that the Ramsey number, R(H,H) of any r-uniform hypergraph H with maximum degree at most Δ is at most C|V (H)|1+ . © 2006 Elsevier Inc. All rights reserved.
متن کاملD ec 2 00 6 EMBEDDINGS AND RAMSEY NUMBERS OF SPARSE k - UNIFORM HYPERGRAPHS
Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [5, 19] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 35 شماره
صفحات -
تاریخ انتشار 2015