Ryser's conjecture for tripartite 3-graphs

Combinatorica

Volumn 21, Issue 1, 2001, Pages 1-4

  Aharoni, Ron ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039845553     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930170001     Document Type: Article

References (8)

1. R. AHARONI and P. MAXELL: Hall's theorem for hypergraphs, J. Graph Theory, 35 (2000), 83-88.
2. Z. FÜREDI: Maximum degree and fractional matchings in uniform hypergraphs, Combinatorica 1 (1981), 155-162.
3. P. HALL: Distinct representatives of subsets, J. London Math. Soc., 10 (1934), 26-30.
4. P. E. HAXELL: A note on a conjecture of Ryser, Period. Math. Hungar., 30 (1995), 73-79.
5. D. KÖNIG: Theorie der endlichen und unendlichen Graphen, Leipzig, 1936.
6. L. LOVÁSZ: On minimax theorems of combinatorics, Ph.D thesis, Matemathikai Lapok 26 (1975), 209-264 (in Hungarian).
7. E. SZEMERÉDI and ZS. TUZA: Upper bound for transversals of tripartite hypergraphs, Period. Math. Hungar., 13 (1982), 321-323.
8. ZS. TUZA: On the order of vertex sets meeting all edges of a 3-partite hypergraph, Ars Combin., 24 (1987), A, 59-63.