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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Rainbow -factors of complete -uniform -partite hypergraphs.”
The Ramsey number of diamond-matchings and loose cycles in hypergraphs.
On chromatic and achromatic numbers of uniform hypergraphs
Ernest Jucovič, František Olejník (1974)
Časopis pro pěstování matematiky
Similarity:
Theorems of the Nordhaus-Gaddum type for -uniform hypergraphs
František Olejník (1981)
Mathematica Slovaca
Similarity:
Hypergraphs with large transversal number and with edge sizes at least four
Michael Henning, Christian Löwenstein (2012)
Open Mathematics
Similarity:
Let H be a hypergraph on n vertices and m edges with all edges of size at least four. The transversal number τ(H) of H is the minimum number of vertices that intersect every edge. Lai and Chang [An upper bound for the transversal numbers of 4-uniform hypergraphs, J. Combin. Theory Ser. B, 1990, 50(1), 129–133] proved that τ(H) ≤ 2(n+m)/9, while Chvátal and McDiarmid [Small transversals in hypergraphs, Combinatorica, 1992, 12(1), 19–26] proved that τ(H) ≤ (n + 2m)/6. In this paper, we...
A Characterization of Hypergraphs with Large Domination Number
Michael A. Henning, Christian Löwenstein (2016)
Discussiones Mathematicae Graph Theory
Similarity:
Let H = (V, E) be a hypergraph with vertex set V and edge set E. A dominating set in H is a subset of vertices D ⊆ V such that for every vertex v ∈ V D there exists an edge e ∈ E for which v ∈ e and e ∩ D ≠ ∅. The domination number γ(H) is the minimum cardinality of a dominating set in H. It is known [Cs. Bujtás, M.A. Henning and Zs. Tuza, Transversals and domination in uniform hypergraphs, European J. Combin. 33 (2012) 62-71] that for k ≥ 5, if H is a hypergraph of order n and size...
Rainbow -factors.
Yuster, Raphael (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: