The Clique Structure of Johnson Graphs
From MaRDI portal
Publication:6408935
arXiv2208.12710MaRDI QIDQ6408935FDOQ6408935
Authors: Pavel Shuldiner, R. Wayne Oldford 
Publication date: 26 August 2022
Abstract: Motivated by an approach to visualization of high dimensional statistical data given in Hurley and Oldford (2011), this work examines the clique structure of 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.
This page was built for publication: The Clique Structure of Johnson Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6408935)
