Colorings versus list colorings of uniform hypergraphs

2020 ◽  
Vol 95 (3) ◽  
pp. 384-397
Author(s):  
Wei Wang ◽  
Jianguo Qian ◽  
Zhidan Yan
Keyword(s):  
Uniform Hypergraphs ◽  
List Colorings

scholarly journals A Paintability Version of the Combinatorial Nullstellensatz, and List Colorings of $k$-partite $k$-uniform Hypergraphs

10.37236/448 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Uwe Schauz
Keyword(s):  
Upper Bound ◽  
Bipartite Graphs ◽  
Combinatorial Nullstellensatz ◽  
List Coloring ◽  
Line List ◽  
Uniform Hypergraphs ◽  
Coloring Number ◽  
Subject Specific ◽  
List Colorings ◽  
On Line

We study the list coloring number of $k$-uniform $k$-partite hypergraphs. Answering a question of Ramamurthi and West, we present a new upper bound which generalizes Alon and Tarsi's bound for bipartite graphs, the case $k=2$. Our results hold even for paintability (on" line list colorability). To prove this additional strengthening, we provide a new subject"=specific version of the Combinatorial Nullstellensatz.

scholarly journals Rainbow matchings for 3-uniform hypergraphs

2021 ◽  
Vol 183 ◽  
pp. 105489
Author(s):  
Hongliang Lu ◽  
Xingxing Yu ◽  
Xiaofan Yuan
Keyword(s):  
Uniform Hypergraphs

scholarly journals Hypercycle Systems of 5-Cycles in Complete 3-Uniform Hypergraphs

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 484
Author(s):  
Anita Keszler ◽  
Zsolt Tuza
Keyword(s):  
Element Subset ◽  
Uniform Hypergraphs ◽  
Vertex Set ◽  
Recursive Constructions

In this paper, we consider the problem of constructing hypercycle systems of 5-cycles in complete 3-uniform hypergraphs. A hypercycle system C(r,k,v) of order v is a collection of r-uniform k-cycles on a v-element vertex set, such that each r-element subset is an edge in precisely one of those k-cycles. We present cyclic hypercycle systems C(3,5,v) of orders v=25,26,31,35,37,41,46,47,55,56, a highly symmetric construction for v=40, and cyclic 2-split constructions of orders 32,40,50,52. As a consequence, all orders v≤60 permitted by the divisibility conditions admit a C(3,5,v) system. New recursive constructions are also introduced.

scholarly journals On Frankl and Füredi’s conjecture for 3-uniform hypergraphs

2016 ◽  
Vol 32 (1) ◽  
pp. 95-112 ◽  
Author(s):  
Qing-song Tang ◽  
Hao Peng ◽  
Cai-ling Wang ◽  
Yue-jian Peng
Keyword(s):  
Uniform Hypergraphs

scholarly journals Transversals in uniform hypergraphs with property (7,2)

1999 ◽  
Vol 207 (1-3) ◽  
pp. 277-284
Author(s):  
Dmitry G. Fon-Der-Flaass ◽  
Alexandr V. Kostochka ◽  
Douglas R. Woodall
Keyword(s):  
Uniform Hypergraphs

scholarly journals Some Motzkin–Straus type results for non-uniform hypergraphs

2014 ◽  
Vol 31 (1) ◽  
pp. 223-238 ◽  
Author(s):  
Ran Gu ◽  
Xueliang Li ◽  
Yuejian Peng ◽  
Yongtang Shi
Keyword(s):  
Uniform Hypergraphs

Nearly Perfect Matchings in Uniform Hypergraphs

2021 ◽  
Vol 35 (2) ◽  
pp. 1022-1049
Author(s):  
Hongliang Lu ◽  
Xingxing Yu ◽  
Xiaofan Yuan
Keyword(s):  
Perfect Matchings ◽  
Uniform Hypergraphs

Relative Turán Problems for Uniform Hypergraphs

2021 ◽  
Vol 35 (3) ◽  
pp. 2170-2191
Author(s):  
Sam Spiro ◽  
Jacques Verstraëte
Keyword(s):  
Uniform Hypergraphs ◽  
Turan Problems
Sign in / Sign up

Export Citation Format

Share Document