AbstractIf a system H of triples (3-uniform hypergraph) on n vertices has the following property: for every 3-coloring of the vertex-set there exists a 3-colored triple, what is the minimum size (S(n)) of H? The first values of S(n) are computed and the asymptotic behaviour of this function is studied
An edge-coloring of the complete graph Kn we call F-caring if it leaves no F-subgraph of Kn monochro...
AbstractLet Cn denote the 3-uniform hypergraph loose cycle, that is the hypergraph with vertices v1,...
We exhibit a family of 3-uniform hypergraphs with the property that their 2-colour Ramsey numbers gr...
AbstractHow many edges must a 3-graph have if, for every k-coloring, there exist a 3-colored edge? E...
We show that for all ℓ and ε > 0 there is a constant c = c(ℓ, ε) > 0 such that every ℓ-coloring of t...
AbstractThe aim of this paper is to prove Theorem 1 which gives a full description of families of 3-...
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is ...
AbstractLet Gi be the (unique) 3-graph with 4 vertices and i edges. Razborov [A. Razborov, On 3-hype...
AbstractFor a fixed 3-uniform hypergraph F, call a hypergraph F-free if it contains no subhypergraph...
AbstractThe upper chromatic number χ¯(H) of a hypergraph H=(X,E) is the maximum number k for which t...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Given an r-uniform hypergraph H, the multicolor Ramsey number rk(H) is the minimum n such that every...
An edge-coloring of the complete graph Kn we call F-caring if it leaves no F-subgraph of Kn monochro...
AbstractLet Cn denote the 3-uniform hypergraph loose cycle, that is the hypergraph with vertices v1,...
We exhibit a family of 3-uniform hypergraphs with the property that their 2-colour Ramsey numbers gr...
AbstractHow many edges must a 3-graph have if, for every k-coloring, there exist a 3-colored edge? E...
We show that for all ℓ and ε > 0 there is a constant c = c(ℓ, ε) > 0 such that every ℓ-coloring of t...
AbstractThe aim of this paper is to prove Theorem 1 which gives a full description of families of 3-...
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is ...
AbstractLet Gi be the (unique) 3-graph with 4 vertices and i edges. Razborov [A. Razborov, On 3-hype...
AbstractFor a fixed 3-uniform hypergraph F, call a hypergraph F-free if it contains no subhypergraph...
AbstractThe upper chromatic number χ¯(H) of a hypergraph H=(X,E) is the maximum number k for which t...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and ...
Given an r-uniform hypergraph H, the multicolor Ramsey number rk(H) is the minimum n such that every...
An edge-coloring of the complete graph Kn we call F-caring if it leaves no F-subgraph of Kn monochro...
AbstractLet Cn denote the 3-uniform hypergraph loose cycle, that is the hypergraph with vertices v1,...
We exhibit a family of 3-uniform hypergraphs with the property that their 2-colour Ramsey numbers gr...
DOI
Add to ORKG