Pavel Shuldiner, R. Wayne Oldford
Published 2022-08-26Version 1
Motivated by an approach to visualization of high dimensional statistical data given in Hurley and Oldford (2011), this work examines the clique structure of $J_n(m, m-1)$ Johnson graphs. Cliques and maximal cliques are characterized and proved to be of one of only two types. These types are characterized by features of the intersection and of the union of the subsets of [n] = {1, 2, ..., n} which define the vertices of the graph. Clique numbers and clique partition numbers follow. The results on Johnson graphs are connected to results on intersecting families of sets related to extremal set theory.
Comments: 14 pages, 2 figures (3 png files)
Chain-dependent Conditions in Extremal Set Theory
Extremal set theory, cubic forms on $\mathbb{F}_2^n$ and Hurwitz square identities
Tournaments, Johnson Graphs, and NC-Teaching
![QR code for arXiv:2208.12710 [math.CO]](http://oss.arxitics.com/images/favicon.svg)