The extremal function for 3-linked graphs

DOI10.1016/j.jctb.2007.11.008zbMath1171.05030OpenAlexW2000164244MaRDI QIDQ947723

Paul Wollan, Robin Thomas

Publication date: 7 October 2008

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.11.008

zbMATH Keywords

connectivitydisjoint pathsgraph linkages

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (10)

Linkage for the diamond and the path with four vertices ⋮ Combined Degree and Connectivity Conditions for $H$-Linked Graphs ⋮ Some recent progress and applications in graph minor theory ⋮ A graph minor condition for graphs to be \(k\)-linked ⋮ Optimal connectivity for fat-triangle linkages ⋮ An improved linear connectivity bound for tournaments to be highly linked ⋮ An improved linear edge bound for graph linkages ⋮ 7-connected graphs are 4-ordered ⋮ Connectivity for Kite-Linked Graphs ⋮ Rooted topological minors on four vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Disjoint paths in graphs
• 2-linked graphs
• An improved linear edge bound for graph linkages
• Graph minors. IX: Disjoint crossed paths
• Graph minors. XIII: The disjoint paths problem
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• Highly linked graphs
• An extremal function for contractions of graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• A Polynomial Solution to the Undirected Two Paths Problem
• Graph minors and linkages
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes

This page was built for publication: The extremal function for 3-linked graphs