A comment on Ryser's conjecture for intersecting hypergraphs

DOI10.1007/s00373-008-0821-9zbMath1211.05094arXiv0709.3138OpenAlexW1999592073WikidataQ123159846 ScholiaQ123159846MaRDI QIDQ1043791

Toufik Mansour, Chunwei Song, Raphael Yuster

Publication date: 9 December 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0709.3138

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Structural characterization of families of graphs (05C75)

Related Items (13)

A family of extremal hypergraphs for Ryser's conjecture ⋮ Domination in intersecting hypergraphs ⋮ Coverings and matchings in r-partite hypergraphs ⋮ A note on intersecting hypergraphs with large cover number ⋮ Small edge sets meeting all triangles of a graph ⋮ On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs ⋮ Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ Unnamed Item ⋮ Extremal hypergraphs for Ryser's conjecture ⋮ Monochromatic components in edge-colored complete uniform hypergraphs ⋮ Multipartite hypergraphs achieving equality in Ryser's conjecture ⋮ Matching criticality in intersecting hypergraphs

Cites Work

• Ryser's conjecture for tripartite 3-graphs
• Unnamed Item

This page was built for publication: A comment on Ryser's conjecture for intersecting hypergraphs