Generalized polygon
Definition
Let be an incidence structure with point set , line set and incidence relation . Its incidence graph is the bipartite graph with vertex set , with an edge between and when . Let be an integer. The structure is a generalized -gon if its incidence graph is connected, has diameter , and has girth . Here the diameter is the largest distance between two vertices of the graph. A generalized -gon is thick if every point lies on at least three lines and every line has at least three points.
Remarks
Example: the Fano plane is a generalized -gon. Two points lie on a common line, and two lines meet in a point, so in both cases the distance is . A point and a line not through it are at distance , so the diameter is . A cycle of length would give two points on two common lines, which is impossible. A triangle of the plane gives a cycle of length , so the girth is . It is thick, since each line has points and each point is on lines.
Non-example: the affine plane of order , with points and the lines of points each. Its girth is , but two parallel lines have no common point, so they are at distance ; the diameter is .
For , any two points lie on at most one line, so a generalized -gon is a partial linear space. The generalized -gons with at least three points on each line and three lines on each point are exactly the projective planes, and the generalized -gons are the generalized quadrangles. A finite thick generalized -gon has an order : every line has points and every point is on lines.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Bipartite graph concept
- Girth concept
- Graph concept
- Incidence structure concept
- Generalized polygon definition
Further reading
About this page
| Tag | DKT8Z2M9CB |
|---|---|
| URI | m2://DKT8Z2M9CB |
| Kind | definition |
| Writing | W0 stub |
| MSC | 51E12, 51E24 |
| Defines | Generalized polygon |
| Uses | Incidence structure, Bipartite graph, Girth, Graph |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.