2010/02/02 by Italo J. Dejter, Dejter, Italo J.
Computer Science · Engineering · Mathematics · #05B30 #05C20 #05C38 52C30 #05C62 #68-04 #Coding theory and cryptography #Combinatorics #Combinatorics (math.CO) #Discrete mathematics #Dual (grammatical number) #FOS: Mathematics #Finite Group Theory Research #Graph #Mathematics #Physics #graph theory and CDMA systems #math.CO #msc:05B30 #msc:05C20 #msc:05C38 #msc:05C62 #msc:52C30 #msc:68-04
paper · pdf · doi:10.48550/arxiv.1002.0588
published in arXiv (Cornell University) (Cornell University) · 20 pages, 7 figures, 9 tables
openalex publication_date 2010/02/02 · arxiv created 2013/01/09 · arxiv updated 2013/01/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Self-dual 1-configurations (nd)1 possess their Menger graph \mathcal Y most K4-separated among connected self-dual configurations (nd). Such \mathcal Y is most symmetric if Kd-ultrahomogeneous. In this work, such a \mathcal Y is presented for (n,d)=(102,4) and shown to relate n copies of the cuboctahedral graph L(Q3) to the n copies of Kd; these are shown to share each copy of K3 exactly with two copies of L(Q3).