A note on the \(k\)-colored crossing ratio of dense geometric graphs

DOI10.1016/j.comgeo.2024.102123MaRDI QIDQ6639374

R. Fabila-Monroy

Publication date: 15 November 2024

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

geometric graphscrossing numbersSzemerédi's regularity lemmaorder type

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Erd?s problems and related topics of discrete geometry (52C10) Density (toughness, etc.) (05C42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Supersaturated graphs and hypergraphs
• Crossing families
• A positive fraction Erdős-Szekeres theorem
• On geometric graphs with no \(k\) pairwise parallel edges
• Planar point sets determine many pairwise crossing segments
• On the 2-colored crossing number
• Graph Theory
• Multidimensional Sorting
• Research Problems in Discrete Geometry
• On sets of integers containing k elements in arithmetic progression
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph

This page was built for publication: A note on the \(k\)-colored crossing ratio of dense geometric graphs

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