The Ramsey number of diamond-matchings and loose cycles in hypergraphs.
Gyárfás, András, Sárközy, Gábor N., Szemerédi, Endre (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “One More Turán Number and Ramsey Number for the Loose 3-Uniform Path of Length Three”
The Ramsey number of diamond-matchings and loose cycles in hypergraphs.
Hypergraphs with Pendant Paths are not Chromatically Unique
Ioan Tomescu (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In this note it is shown that every hypergraph containing a pendant path of length at least 2 is not chromatically unique. The same conclusion holds for h-uniform r-quasi linear 3-cycle if r ≥ 2.
On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs.
Kostochka, Alexandr (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On chromatic and achromatic numbers of uniform hypergraphs
Ernest Jucovič, František Olejník (1974)
Časopis pro pěstování matematiky
Similarity:
On edge independence numbers and edge covering numbers of -uniform hypergraph
František Olejník (1989)
Mathematica Slovaca
Similarity:
Chromatic Polynomials of Mixed Hypercycles
Julian A. Allagan, David Slutzky (2014)
Discussiones Mathematicae Graph Theory
Similarity:
We color the vertices of each of the edges of a C-hypergraph (or cohypergraph) in such a way that at least two vertices receive the same color and in every proper coloring of a B-hypergraph (or bihypergraph), we forbid the cases when the vertices of any of its edges are colored with the same color (monochromatic) or when they are all colored with distinct colors (rainbow). In this paper, we determined explicit formulae for the chromatic polynomials of C-hypercycles and B-hypercycles ...
Rainbow -factors of complete -uniform -partite hypergraphs.
Chen, Ailian, Zhang, Fuji, Li, Hao (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A linear upper bound in zero-sum Ramsey theory.
Caro, Yair (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Constrained Colouring and σ-Hypergraphs
Yair Caro, Josef Lauri, Christina Zarb (2015)
Discussiones Mathematicae Graph Theory
Similarity:
A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignment of colours to its vertices such that no edge of H contains less than α or more than β vertices with different colours. This notion, introduced by Bujtás and Tuza, generalises both classical hypergraph colourings and more general Voloshin colourings of hypergraphs. In fact, for r-uniform hypergraphs, classical colourings correspond to (2, r)-colourings while an important instance of...