Geometric graphs with no self-intersecting path of length three

DOI10.1016/j.ejc.2003.09.019zbMath1050.05038OpenAlexW2036775915MaRDI QIDQ1883291

Rom Pinchasi, János Pach, Gábor Tardos, Géza Tóth

Publication date: 4 October 2004

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2003.09.019

zbMATH Keywords

geometric graphself-intersecting pathstraight-line edges

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

Extremal problems for pairs of triangles ⋮ On the light side of geometric graphs ⋮ An upper bound on the number of edges in an almost planar bipartite graph ⋮ Quantitative Restrictions on Crossing Patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a Turán type problem of Erdős
• Davenport-Schinzel theory of matrices
• Graphs drawn with few crossings per edge
• Small forbidden configurations
• Quasi-planar graphs have a linear number of edges
• On geometric graphs with no \(k\) pairwise parallel edges
• Small forbidden configurations. II
• Cycles of even length in graphs
• Topological graphs with no self-intersecting cycle of length 4
• Toward a theory of crossing numbers

This page was built for publication: Geometric graphs with no self-intersecting path of length three