Tag Archives: Wenger graphs

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 , , , , , , , | Leave a comment