DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE
From MaRDI portal
Publication:4120599
DOI10.1093/qmath/28.1.81zbMath0351.05118OpenAlexW2012094679MaRDI QIDQ4120599
Publication date: 1977
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qmath/28.1.81
Related Items
Maximum degree and fractional matchings in uniform hypergraphs ⋮ Matchings and covers in hypergraphs ⋮ Intersecting designs from linear programming and graphs of diameter two
This page was built for publication: DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE
