The discharging method in combinatorial geometry and the Pach-Sharir conjecture

MaRDI QIDQ3514528zbMATH OpenFDO

Authors Radoš Radoičić, Géza Tóth

Publication date 21 July 2008

zbMATH Keywords

surveydischarging method

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• On the chromatic number of intersection graphs of convex sets in the plane
• Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
• Applications of graph and hypergraph theory in geometry
• Coloring k _k -free intersection graphs of geometric objects in the plane
• scientific article; zbMATH DE number 66689

Cited in

(11)

• The number of small-degree vertices in matchstick graphs
• On the largest planar graphs with everywhere positive combinatorial curvature
• On the Zarankiewicz problem for intersection hypergraphs
• Combinatorics of local search: an optimal 4-local Hall's theorem for planar graphs
• Separator theorems and Turán-type results for planar intersection graphs
• Light structures in infinite planar graphs without the strong isoperimetric property
• On topological graphs with at most four crossings per edge
• Open problems
• Applications of graph and hypergraph theory in geometry
• A Separator Theorem for String Graphs and Its Applications
• General penny graphs are at most \(\frac{43}{18}\)-dense

This page was built for publication: The discharging method in combinatorial geometry and the Pach-Sharir conjecture

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