A survey of Zarankiewicz problem in geometry

2024-09-24

arXiv.org

AI Summary

This paper systematically investigates the Zarankiewicz problem in geometric settings: estimating the extremal number $mathrm{ex}(n,K_{t,t})$, i.e., the maximum number of incidences between $n$ points and $n$ geometric objects (e.g., lines, circles, or spherical distance pairs), under the constraint of forbidding a complete bipartite subgraph $K_{t,t}$. Methodologically, it unifies extremal graph theory with classical incidence geometry—introducing a novel analytical framework that characterizes how geometric structure both strengthens forbidden-subgraph constraints and enables their circumvention. Employing polynomial methods, finite-field geometry, combinatorial designs, and Cauchy–Schwarz arguments, the work improves both upper and lower bounds for $mathrm{ex}(n,K_{t,t})$ in real/complex point-line, point-circle, and spherical distance configurations. It establishes the currently best asymptotic estimates and precisely identifies several key open problems and promising avenues for further improvement.

Technology Category

• Constraint Satisfaction and Optimization: Other Foundations of Constraint Satisfaction
• Knowledge Representation and Reasoning: Geometric, Spatial, and Temporal Reasoning
• Search and Optimization: Combinatorial Optimization

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Security and Privacy: Large-scale security measurements
• Responsible Web: Measurement, analysis, and circumvention of Web censorship

Abstract

One of the central topics in extremal graph theory is the study of the function $ex(n,H)$, which represents the maximum number of edges a graph with $n$ vertices can have while avoiding a fixed graph $H$ as a subgraph. Tur{'a}n provided a complete characterization for the case when $H$ is a complete graph on $r$ vertices. Erd{H o}s, Stone, and Simonovits extended Tur{'a}n's result to arbitrary graphs $H$ with $chi(H)>2$ (chromatic number greater than 2). However, determining the asymptotics of $ex(n, H)$ for bipartite graphs $H$ remains a widely open problem. A classical example of this is Zarankiewicz's problem, which asks for the asymptotics of $ex(n, K_{t,t})$. In this paper, we survey Zarankiewicz's problem, with a focus on graphs that arise from geometry. Incidence geometry, in particular, can be viewed as a manifestation of Zarankiewicz's problem in geometrically defined graphs.

Problem

• Study maximum edges in graphs avoiding fixed subgraphs.
• Focus on Zarankiewicz's problem for bipartite graphs.
• Explore geometric graphs and incidence geometry applications.

Innovation

• Focuses on Zarankiewicz's problem in geometry
• Uses incidence geometry to study graph asymptotics
• Explores extremal graph theory for bipartite graphs