Turán-Type Problems

Edge-maximal graphs and hypergraphs avoiding fixed substructures.

field tier

Turán-Type Problems. Edge-maximal graphs and hypergraphs avoiding fixed substructures.

Foundations and canonical references

The standard treatments of turán-type problems approach the subject from complementary angles. Jukna, Extremal Combinatorics (2011) is the anchor reference for the subject and lays out the core definitions, theorems, and worked examples that practitioners return to.

Open methodological questions for turán-type problems include sharpening the bridges between foundational theory and computational practice, extending classical results to broader or more structured settings, and integrating the techniques surveyed above with adjacent mathematical disciplines. The references listed in this page are the entry points that current work builds on.

Prerequisites

Sources

  • textbook · primary · 2011
    Extremal Combinatorics
    jukna-2011

In context

Where this topic sits in the prerequisite graph. Click any node to jump.

Open in full atlas →

Review this topic

This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.