Estimating the Number of Disjoint Edges in Simple Topological Graphs via Cylindrical Drawings

DOI10.1137/130925554zbMath1295.05087arXiv1307.4191OpenAlexW2055165220MaRDI QIDQ4979827

Radoslav Fulek

Publication date: 19 June 2014

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

Full work available at URL: https://arxiv.org/abs/1307.4191

zbMATH Keywords

matchingextremal combinatoricscomplete topological graph

Mathematics Subject Classification ID

Factorization of matrices (15A23) Theory of matrix inversion and generalized inverses (15A09) Determinants, permanents, traces, other special matrix functions (15A15) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

Shooting stars in simple drawings of \(K_{m,n}\) ⋮ Twisted ways to find plane structures in simple drawings of complete graphs ⋮ Many disjoint edges in topological graphs ⋮ Unnamed Item ⋮ Many disjoint edges in topological graphs ⋮ Empty triangles in complete topological graphs

This page was built for publication: Estimating the Number of Disjoint Edges in Simple Topological Graphs via Cylindrical Drawings