Large maximal \(\{ 0,1,2,\dots,t\}\)-cliques of the \(q\)-analog of the Johnson graph

DOI10.1006/eujc.1996.0061zbMath0861.05061OpenAlexW2028234404MaRDI QIDQ2563523

Sul-young Choi

Publication date: 16 December 1996

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1996.0061

zbMATH Keywords

intersecting familyJohnson graphvector spacelinear latticeErdös-Ko-Rado theorem\(t\)-clique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Association schemes, strongly regular graphs (05E30) Extremal set theory (05D05)

Related Items (1)

A new class of transitive graphs

This page was built for publication: Large maximal \(\{ 0,1,2,\dots,t\}\)-cliques of the \(q\)-analog of the Johnson graph