Covering complete geometric graphs by monotone paths

DOI10.2140/CNT.2026.15.73MaRDI QIDQ7240840zbMATH OpenFDO

Authors Adrian Dumitrescu, János Pach, Morteza Saghafian, Alex Scott

Publication date 12 May 2026

Published in Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/CNT.2026.15.73

zbMATH Keywords

complete graphconvexitycrossing familygeometric graphplane subgraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites work

• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Covering the edges of a complete geometric graph with convex polygons
• Decomposition of Geometric Graphs into Star Forests
• Disjoint edges in geometric graphs
• Edge partitions of complete geometric graphs
• Geometric graphs with few disjoint edges
• scientific article; zbMATH DE number 3643294 (Why is no real title available?)
• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• Monotone paths in planar convex subdivisions and polytopes
• Noncrossing Subgraphs in Topological Layouts
• Note on geometric graphs
• On Sets of Distances of n Points
• On the chromatic number of some geometric type Kneser graphs
• Order on order types
• Partitions of complete geometric graphs into plane trees
• Ramsey-type results for geometric graphs. I
• Ramsey-type results for geometric graphs. II
• Research Problems in Discrete Geometry
• Some geometric applications of Dilworth's theorem

This page was built for publication: Covering complete geometric graphs by monotone paths

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