arXiv (All)
open access
Erdős-Ko-Rado properties of Steiner 2-designs
In this paper, we prove an Erdős-Ko-Rado characterisation of maximum intersecting families of blocks in Steiner $2$-designs arising from Desarguesian maximal arcs. This answers a recent question of Goryainov and Konstantinova, and implies that, among the known Steiner $2$-designs, only finitely many
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Extremal Families for the Erdős--Kleitman Problem: The Missing Constructions#800116
- Extremal hypergraphs without generalized 4-cycles#1142055
- On Erdős Problem 767: Cycles with Chords#1109357
- Bipartite Turán Numbers of Trees and Star Forests#1118674
- Clique covers and decompositions of cliques of graphs#1122901
Record · ID 1062495
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive