Cycle-connected graphs

DOI10.1016/0012-365X(92)90680-EzbMath0776.05057OpenAlexW2025848774WikidataQ105742624 ScholiaQ105742624MaRDI QIDQ1201258

Vojtěch Rödl, Richard A. Duke

Publication date: 17 January 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90680-e

zbMATH Keywords

multipartite graphscycle-connected graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Related Items (2)

On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs ⋮ On large intersecting subfamilies of uniform setfamilies

Cites Work

• The Erdős-Ko-Rado theorem for small families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycle-connected graphs