DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE

DOI10.1093/QMATH/28.1.81zbMATH Open0351.05118OpenAlexW2012094679MaRDI QIDQ4120599FDOQ4120599

Authors: Béla Bollobás 

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (3)

• Maximum degree and fractional matchings in uniform hypergraphs
• Intersecting designs from linear programming and graphs of diameter two
• Matchings and covers in hypergraphs

This page was built for publication: DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4120599)