Tag Archives: generalized quadrangles

Wenger graphs

A central (and foundational) question in extremal graph theory is the forbidden subgraph problem of Turán, which asks for the largest number of edges in an -vertex graph that does not contain any copy of a given graph as its … Continue reading

Posted in Combinatorics, Extremal Combinatorics, Finite Geometry, Incidence Geometry | Tagged , , , , , , , | 1 Comment

Point-Line Geometries

Some notation: The set will be denoted by . For every set we have the set of all subsets of , also known as the power set, which we will denote by . This notation makes some sense if you … Continue reading

Posted in Combinatorics, Finite Geometry | Tagged , , | 3 Comments