DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE

From MaRDI portal

Revision as of 08:19, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4120599

Jump to:navigation, search

DOI10.1093/qmath/28.1.81zbMath0351.05118OpenAlexW2012094679MaRDI QIDQ4120599

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)

Related Items (3)

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4120599&oldid=17902156"