Transversals in uniform hypergraphs with property (7, 2)

DOI10.1016/S0012-365X(99)00114-4MaRDI QIDQ1817581zbMATH OpenOpenAlexWikidataFDO

Authors Dmitry G. Fon-Der-Flaass, Douglas R. Woodall, Alexandr Kostochka

Publication date 22 February 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)00114-4

zbMATH Keywords

transversaluniform hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65)

Review text

Let \(f(r,p,2)\) \((p> 1, r\geq 2)\) be the maximum of the cardinality of a minimum transversal over all \(r\)-uniform hypergraphs \(\mathcal{H}\) possessing the property that every subhypergraph of \(\mathcal{H}\) with \(p\) edges has a transversal of size \(2\). The values of \(f(r,p,2)\) for \(p=3,4,5,6\) were found by \textit{P. Erdős, D. Fon-Der-Flaass, A. V. Kostochka} and \textit{Zs. Tuza} [Sib. Adv. Math. 2, No. 1, 82-88 (1992; Zbl 0848.05049)]. The case \(p=7\) is much harder. The authors give some interesting bounds on \(f(r,7,2)\). In particular, they show that \(f(4k,7,2)\geq 3k+1\) for \(k \geq 10\) and that \(f(r,7,2)\leq \lceil 7r/8\rceil\).

Recommendations

• Transversals in uniform hypergraphs with property \((p,2)\)
• Transversal numbers of uniform hypergraphs
• Upper transversals in hypergraphs
• Small transversals in uniform hypergraphs

Cited in

(5)

• Vertex-transitive semi-triangular graphs with \(\mu=7\)
• Transversals in uniform hypergraphs with property \((p,2)\)
• Small transversals in uniform hypergraphs
• Covering graphs by monochromatic trees and Helly-type results for hypergraphs
• Covering random graphs with monochromatic trees

This page was built for publication: Transversals in uniform hypergraphs with property (7, 2)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817581)