Bounded degrees and prescribed distances in graphs

DOI10.1016/0012-365X(93)90144-IzbMath0786.05030OpenAlexW2044686427MaRDI QIDQ686447

Zsolt Tuza, Yair Caro

Publication date: 5 May 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90144-i

zbMATH Keywords

boundmaximum degreeantipodal set-pairprescribed distances

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Intersection patterns of convex sets
• Critical hypergraphs and interesting set-pair systems
• Inequalities for two set systems with prescribed intersections
• Hypergraph coverings and local colorings
• An extremal problem for two families of sets
• Minimum number of elements of representing a set system of given rank
• On generalized graphs

This page was built for publication: Bounded degrees and prescribed distances in graphs