An isoperimetric lemma

DOI10.1016/0012-365X(91)90027-YzbMath0756.05064OpenAlexW2020942868WikidataQ125055150 ScholiaQ125055150MaRDI QIDQ1182970

Arie Bialostocki, P. Dierker

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90027-y

zbMATH Keywords

partitionconnected componentmultipartite graphisoperimetric lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Partitions of sets (05A18)

Related Items (1)

Multipartite Turán problem for connected graphs and hypergraphs

Cites Work

• Maximum degree and fractional matchings in uniform hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An isoperimetric lemma