The largest complete bipartite subgraph in point-hyperplane incidence graphs

DOI10.37236/8253zbMath1431.05087arXiv1810.01551OpenAlexW3000142391MaRDI QIDQ2288177

Thao T. Do

Publication date: 17 January 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.01551

zbMATH Keywords

hyperplanesincidence graphincidences

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Erd?s problems and related topics of discrete geometry (52C10) Ramsey theory (05D10)

Cites Work

• Two theorems on point-flat incidences
• Covering lattice points by subspaces and counting point-hyperplane incidences
• On counting point-hyperplane incidences
• Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
• Incidences of not-too-degenerate hyperplanes

This page was built for publication: The largest complete bipartite subgraph in point-hyperplane incidence graphs