Constructing Trees in Graphs whose Complement has no K2,s

DOI10.1017/S0963548302005102MaRDI QIDQ3146982zbMATH OpenOpenAlexFDO

Authors Edward Dobson

Publication date 3 November 2002

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548302005102

zbMATH Keywords

subgraphstrees

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Constructing trees in graphs with no K_2,s
• scientific article; zbMATH DE number 6493054
• Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs
• Construction for trees without domination critical vertices
• Constructing trees in bipartite graphs
• Construction for trees without vertices contained in all minimum dominating sets.
• Construction and enumeration of spanning trees in a complete graph K_p of odd order
• scientific article; zbMATH DE number 3933121
• The \(k\)-in-a-tree problem for graphs of girth at least \(k\)
• Constructing tree decompositions of graphs with bounded gonality

Cited in

(13)

• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• A variation of the Erdős-Sós conjecture in bipartite graphs
• The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
• On Erdős-Sós conjecture for trees of large size
• scientific article; zbMATH DE number 6493054 (Why is no real title available?)
• A new construction of a Kurepa tree with no Aronszajn subtree
• On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices
• Embedding trees in graphs with independence number two
• A Local Approach to the Erdös--Sós Conjecture
• The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
• Constructing trees in graphs with no K_2,s
• A sufficient degree condition for a graph to contain all trees of size k
• Loebl-Komlós-Sós conjecture: dense case

This page was built for publication: Constructing Trees in Graphs whose Complement has no K_2,s

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3146982)