Generalized Polygons

Generalized Polygons is an incidence structure in finite geometry that generalizes the concept of ordinary polygons by requiring that the incidence graph be a bipartite graph of diameter \( n \) and girth \( 2n \), for some integer \( n \geq 3 \), with the additional property that it contains no cycles of length less than \( 2n \).

48

Publications

1.5K

Citations

69

Authors

50

Institutions

Publications per year

2017–2026

2

Variants

Tits Buildings Of Rank 2

Authors

69

  1. JA
    J. A. Thas

    Ghent University, Belgium

    10 publications · 264 citations

    10

    h-index

  2. HV
    Hendrik Van Maldeghem

    Ghent University, Belgium

    6 publications · 97 citations

    6

    h-index

  3. SE
    Stanley E. Payne

    Miami University, United States

    3 publications · 42 citations

    3

    h-index

  4. SP
    Sam Payne

    Yale University, United States

    3 publications · 67 citations

    3

    h-index

  5. PJ
    Peter J‎. Cameron

    Queen Mary University of London, United Kingdom

    2 publications · 44 citations

    2

    h-index

1–5 of 69

Venues

  1. Geometriae Dedicata

    12 publications · 329 citations

    11

    h-index

  2. Journal of Combinatorial Theory Series A

    7 publications · 114 citations

    7

    h-index

  3. Designs Codes and Cryptography

    3 publications · 42 citations

    2

    h-index

  4. Journal of Algebra

    2 publications · 407 citations

    2

    h-index

  5. European Journal of Combinatorics

    2 publications · 38 citations

    2

    h-index

1–5