Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes

DOI10.1137/050641375zbMath1141.05040OpenAlexW1986701615MaRDI QIDQ3519203

Roel Apfelbaum, Micha Sharir

Publication date: 13 August 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050641375

zbMATH Keywords

hyperplanesincidence graphincidences

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Erd?s problems and related topics of discrete geometry (52C10) Discrete mathematics in relation to computer science (68R99) Combinatorial complexity of geometric structures (52C45)

Related Items (13)

On the number of unit-area triangles spanned by convex grids in the plane ⋮ Two theorems on point-flat incidences ⋮ A semi-algebraic version of Zarankiewicz's problem ⋮ Nondegenerate spheres in four dimensions ⋮ New results for the growth of sets of real numbers ⋮ Extending Erdős-Beck's theorem to higher dimensions ⋮ Covering lattice points by subspaces and counting point-hyperplane incidences ⋮ On totally positive matrices and geometric incidences ⋮ On the number of incidences between points and planes in three dimensions ⋮ Zarankiewicz's problem for semi-algebraic hypergraphs ⋮ A general incidence bound in \(\mathbb{R}^d\) ⋮ The largest complete bipartite subgraph in point-hyperplane incidence graphs ⋮ Representation Complexities of SemiAlgebraic Graphs

This page was built for publication: Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes