AbstractLet F be uniform hypergraph. In the present paper I prove that of |F| < n13 42 then the chromatic number of F is equal to 2. I have a result in the general (not necessarily uniform) case too
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 improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform ca...
AbstractLet k1 ⩽ k2 ⩽ … ⩽ kn be given positive integers and let F denote the set of vectors (l1, …, ...
AbstractLet H be a hypergraph and t a natural number. The sets which can be written and the union of...
AbstractSoit H = (X,F) un hypergraphe h-uniforme avec ∥X∥ = n et soit Lh±1(H) le graphe dont les som...
AbstractThe hypergraph product G□H has vertex set V(G)×V(H), and edge set {e×f:e∈E(G),f∈E(H)}, where...
AbstractLovász asked whether the following is true for each hypergraph H and natural number k:(*) if...
AbstractThe upper chromatic number χ¯(H) of a hypergraph H=(X,E) is the maximum number k for which t...
AbstractMiller was the first to investigate the problem of the chromatic number of set-systems. In t...
AbstractWe investigate the number of proper λ -colourings of a hypergraph extending a given proper p...
AbstractThe transversal number of a given hypergraph is the cardinality of the smallest set of verti...
AbstractIn a recent paper, Borowiecki and Lazuka showed that h-hypergraphs having the property that ...
We improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform ca...
We improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform ca...
AbstractFor a fixed 3-uniform hypergraph F, call a hypergraph F-free if it contains no subhypergraph...
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 improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform ca...
AbstractLet k1 ⩽ k2 ⩽ … ⩽ kn be given positive integers and let F denote the set of vectors (l1, …, ...
AbstractLet H be a hypergraph and t a natural number. The sets which can be written and the union of...
AbstractSoit H = (X,F) un hypergraphe h-uniforme avec ∥X∥ = n et soit Lh±1(H) le graphe dont les som...
AbstractThe hypergraph product G□H has vertex set V(G)×V(H), and edge set {e×f:e∈E(G),f∈E(H)}, where...
AbstractLovász asked whether the following is true for each hypergraph H and natural number k:(*) if...
AbstractThe upper chromatic number χ¯(H) of a hypergraph H=(X,E) is the maximum number k for which t...
AbstractMiller was the first to investigate the problem of the chromatic number of set-systems. In t...
AbstractWe investigate the number of proper λ -colourings of a hypergraph extending a given proper p...
AbstractThe transversal number of a given hypergraph is the cardinality of the smallest set of verti...
AbstractIn a recent paper, Borowiecki and Lazuka showed that h-hypergraphs having the property that ...
We improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform ca...
We improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform ca...
AbstractFor a fixed 3-uniform hypergraph F, call a hypergraph F-free if it contains no subhypergraph...
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 improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform ca...
AbstractLet k1 ⩽ k2 ⩽ … ⩽ kn be given positive integers and let F denote the set of vectors (l1, …, ...