Add to ORKGFix an integer k ≥ 3. A k-uniform hypergraph is simple if every two edges share at most one vertex. We prove that there is a constant c depending only on k such that every simple k-uniform hypergraph H with maximum degree ∆ has chromatic number satisfying χ(H) < c log
A triangle in a hypergraph is a collection of distinct vertices u, v, w and distinct edges e, f, g w...
AbstractLet H be a hypergraph. For a k-edge coloring c:E(H)→{1,…,k} let f(H,c) be the number of comp...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
Fix an integer k ≥ 3. A k-uniform hypergraph is simple if every two edges share at most one vertex. ...
AbstractThis work deals with a classical combinatorial problem of P. Erdős and A. Hajnal concerning ...
Fix r ≥ 2 and a collection of r-uniform hypergraphs H. What is the minimum number of edges in an H-f...
Fix r ≥ 2 and a collection of r-uniform hypergraphs H. What is the minimum number of edges in an H-f...
Abstract. Let m∗(n) be the minimum number of edges in an n-uniform sim-ple hypergraph that is not tw...
AbstractLet H be ak-uniform hypergraph in which no two edges share more thantcommon vertices, and le...
AbstractThe first author showed that the list chromatic number of every graph with average degree d ...
AbstractLet F be uniform hypergraph. In the present paper I prove that of |F| < n13 42 then the chro...
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant ...
Let H be a k-uniform hypergraph with n vertices. A strong r-coloring is a partition of the vertices ...
Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-n...
The upper chromatic number χ(H) of a hypergraph H is the maximum number of colors in a coloring avoi...
A triangle in a hypergraph is a collection of distinct vertices u, v, w and distinct edges e, f, g w...
AbstractLet H be a hypergraph. For a k-edge coloring c:E(H)→{1,…,k} let f(H,c) be the number of comp...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
Fix an integer k ≥ 3. A k-uniform hypergraph is simple if every two edges share at most one vertex. ...
AbstractThis work deals with a classical combinatorial problem of P. Erdős and A. Hajnal concerning ...
Fix r ≥ 2 and a collection of r-uniform hypergraphs H. What is the minimum number of edges in an H-f...
Fix r ≥ 2 and a collection of r-uniform hypergraphs H. What is the minimum number of edges in an H-f...
Abstract. Let m∗(n) be the minimum number of edges in an n-uniform sim-ple hypergraph that is not tw...
AbstractLet H be ak-uniform hypergraph in which no two edges share more thantcommon vertices, and le...
AbstractThe first author showed that the list chromatic number of every graph with average degree d ...
AbstractLet F be uniform hypergraph. In the present paper I prove that of |F| < n13 42 then the chro...
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant ...
Let H be a k-uniform hypergraph with n vertices. A strong r-coloring is a partition of the vertices ...
Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-n...
The upper chromatic number χ(H) of a hypergraph H is the maximum number of colors in a coloring avoi...
A triangle in a hypergraph is a collection of distinct vertices u, v, w and distinct edges e, f, g w...
AbstractLet H be a hypergraph. For a k-edge coloring c:E(H)→{1,…,k} let f(H,c) be the number of comp...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...