scientific article; zbMATH DE number 4214050

zbMATH Open0734.05064MaRDI QIDQ3360902FDOQ3360902

Author name not available (Why is that?)

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• Disjoint edges in geometric graphs
• Some geometric applications of Dilworth's theorem
• Near equipartitions of colored point sets
• Extremal problems for geometric hypergraphs
• Geometric graphs with few disjoint edges

zbMATH Keywords

matchinggeometric graphgeometric d-hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cited In (21)

• The hamburger theorem
• Algorithms for ham-sandwich cuts
• Some geometric applications of Dilworth's theorem
• Some combinatorial problems
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• Convex equipartitions of colored point sets
• Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
• Maximum rectilinear crossing number of uniform hypergraphs
• Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
• Extremal problems for geometric hypergraphs
• Continuity of extensions of Lipschitz maps and of monotone maps
• Near equipartitions of colored point sets
• A survey of mass partitions
• Complexity results on untangling red-blue matchings
• Discrete geometry on colored point sets in the plane -- a survey
• Multi-colored spanning graphs
• Simple alternating path problem
• On geometric graphs on point sets in the plane
• Disjoint edges in geometric graphs
• The geometry and combinatorics of discrete line segment hypergraphs
• Applications of a semi-dynamic convex hull algorithm

This page was built for publication:

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