Upper bound on the order of tau-critical hypergraphs

DOI10.1016/0095-8956(82)90065-XzbMath0498.05050MaRDI QIDQ1171073

S. Singh

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

transversal numberbipartite matchingsr-uniform hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (10)

The largest transversal numbers of uniform hypergraphs ⋮ The Szemerédi-Petruska conjecture for a few small values ⋮ An asymptotic resolution of a conjecture of Szemerédi and Petruska ⋮ The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform \(\tau\)-critical hypergraphs ⋮ \(\mathcal{P}\)-apex graphs ⋮ Eckhoff's problem on convex sets in the plane ⋮ Matchings and covers in hypergraphs ⋮ Minimum number of elements of representing a set system of given rank ⋮ Petruska's question on planar convex sets ⋮ Critical hypergraphs and interesting set-pair systems

Cites Work

• On generalized graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper bound on the order of tau-critical hypergraphs