Ryser's Conjecture for Tripartite 3-Graphs

@article{Aharoni2001RysersCF,
  title={Ryser's Conjecture for Tripartite 3-Graphs},
  author={Ron Aharoni},
  journal={Combinatorica},
  year={2001},
  volume={21},
  pages={1-4}
}
A hypergraph is a set of subsets, called edges, of some ground set, whose elements are called vertices. A hypergraph is called r-uniform (or an rgraph) if all its edges are of the same size, r. An r-uniform hypergraph is called r-partite if its vertex set V (H) can be partitioned into sets V1, . . . ,Vr (called the “sides” of the hypergraph) in such a way that each edge meets each Vi in precisely one vertex. A matching in a hypergraph is a set of disjoint edges. The matching number, ν(H), of a… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

On minimax theorems of combinatorics

  • L. Lovász
  • Ph.D thesis, Matemathikai Lapok
  • 1975
Highly Influential
4 Excerpts

Haxell: A note on a conjecture of Ryser, Period

  • P E.
  • Math. Hungar.,
  • 1995
1 Excerpt

On the order of vertex sets meeting all edges of a 3-partite hypergraph

  • Zs. Tuza
  • Ars Combin.,
  • 1987
1 Excerpt

Upper bound for transversals of tripartite hypergraphs

  • E. Szemerédi, Zs. Tuza
  • Period. Math. Hungar.,
  • 1982
1 Excerpt

Distinct representatives of subsets

  • P. Hall
  • J. London Math. Soc.,
  • 1934
1 Excerpt

Similar Papers

Loading similar papers…