Ramsey-type theorem for spatial graphs

DOI10.1007/S003730050016MaRDI QIDQ1385300zbMATH OpenOpenAlexFDO

Authors Seiya Negami

Publication date 26 April 1998

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s003730050016

zbMATH Keywords

imbeddingRamsey-type theoremspatial graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Generalized Ramsey theory (05C55)

Review text

The author shows that for every imbedding of a graph \(H\) in \(\mathbb{R}^3\), there exist positive integers \(m\) and \(n\) such that every imbedding of the complete bipartite graph \(K_{m,n}\) in \(\mathbb{R}^3\) whose projection in the \(xy\)-plane consists entirely of straight edges contains a subgraph which is ambient isotopic to \(H\).

Recommendations

• scientific article; zbMATH DE number 861341
• Ramsey Theorems for Knots, Links and Spatial Graphs
• Topological Ramsey theorem for complete bipartite graphs
• Note on Ramsey theorems for spatial graphs

Cited in

(7)

• Topological Ramsey theorem for complete bipartite graphs
• Ramsey-type theorems for spatial graphs and good drawings
• Knots and links in spatial graphs: a survey
• Globally sparse vertex‐ramsey graphs
• scientific article; zbMATH DE number 861341 (Why is no real title available?)
• Ramsey Theorems for Knots, Links and Spatial Graphs
• Note on Ramsey theorems for spatial graphs

This page was built for publication: Ramsey-type theorem for spatial graphs

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