The isoperimetric number of the incidence graph of PG(n,q)
Andrew Elvey Price, Muhammad Adib Surani, Sanming Zhou

TL;DR
This paper investigates the vertex-isoperimetric number of the incidence graph of projective spaces, providing asymptotic estimates and exact values for specific cases, advancing understanding of combinatorial properties of these graphs.
Contribution
It determines the order of magnitude of the vertex-isoperimetric number for the incidence graph of PG(n,q) and computes exact values for PG(2,q) with q ≤ 16.
Findings
Asymptotic order of the vertex-isoperimetric number for PG(n,q)
Exact values of the vertex-isoperimetric number for PG(2,q) with q ≤ 16
Results contribute to combinatorial understanding of incidence graphs
Abstract
Let be the point-hyperplane incidence graph of the projective space , where is an integer and a prime power. We determine the order of magnitude of , where is the vertex-isoperimetric number of . We also obtain the exact values of and the related incidence-free number of for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Limits and Structures in Graph Theory · Graph theory and applications
