On the maximum number of edges in topological graphs with no four pairwise crossing edges

zbMATH Open1153.68512MaRDI QIDQ3601547FDOQ3601547

Authors: Eyal Ackerman 

Publication date: 10 February 2009

Recommendations

• On the maximum number of edges in topological graphs with no four pairwise crossing edges
• On topological graphs with at most four crossings per edge
• Degenerate crossing numbers
• Crossing Stars in Topological Graphs
• Crossing Stars in Topological Graphs

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (15)

• String graphs and incomparability graphs
• On the maximum number of edges in topological graphs with no four pairwise crossing edges
• Topological hypergraphs
• Topological graphs with no self-intersecting cycle of length 4
• On the maximum number of edges in quasi-planar graphs
• Degenerate crossing numbers
• On topological graphs with at most four crossings per edge
• The maximum number of edges in geometric graphs with pairwise virtually avoiding edges
• \(k\)-quasi-planar graphs
• On disjoint crossing families in geometric graphs
• Intersection reverse sequences and geometric applications.
• Combinatorial Geometry and Graph Theory
• On planar intersection graphs with forbidden subgraphs
• Graph Drawing
• Crossing Stars in Topological Graphs

This page was built for publication: On the maximum number of edges in topological graphs with no four pairwise crossing edges

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