Extremal theory for convex matchings in convex geometric graphs

DOI10.1007/BF02717731zbMath0845.05056OpenAlexW1993625763MaRDI QIDQ1911768

Yaakov S. Kupitz, Micha A. Perles

Publication date: 2 September 1996

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02717731

zbMATH Keywords

extremal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Extremal problems for pairs of triangles ⋮ Ordered and convex geometric trees with linear extremal function ⋮ Blockers for triangulations of a convex polygon and a geometric maker-breaker game ⋮ Saturation problems in convex geometric hypergraphs ⋮ Blockers for simple Hamiltonian paths in convex geometric graphs of odd order ⋮ Blockers for simple Hamiltonian paths in convex geometric graphs of even order ⋮ Extremal problems for convex geometric hypergraphs and ordered hypergraphs

Cites Work

• A Problem in Graph Theory
• On Sets of Distances of n Points
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal theory for convex matchings in convex geometric graphs