On graphs which contain all small trees

DOI10.1016/0095-8956(78)90072-2zbMath0374.05042OpenAlexW1994115477MaRDI QIDQ1245238

Ronald L. Graham, Fan R. K. Chung

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(78)90072-2

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (15)

Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ On unavoidable graphs ⋮ Supertrees ⋮ Panarboreal graphs ⋮ Universal caterpillars ⋮ Sparse multipartite graphs as partition universal for graphs with bounded degree ⋮ Embedding nearly-spanning bounded degree trees ⋮ Expanders Are Universal for the Class of All Spanning Trees ⋮ Perfect Storage Representations for Families of Data Structures ⋮ Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$ ⋮ Optimal threshold for a random graph to be 2-universal ⋮ Size Ramsey Number of Bounded Degree Graphs for Games ⋮ Extremal f-trees and embedding spaces for molecular graphs ⋮ Unnamed Item ⋮ Distance realization problems with applications to internet tomography

Cites Work

• Cycles of even length in graphs
• On extremal problems of graphs and generalized graphs
• Pancyclic graphs. I
• On minimal n-universal graphs
• On Graphs that do not Contain a Thomsen Graph
• On a problem of K. Zarankiewicz
• On the theory of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On graphs which contain all small trees