Application of some techniques in Sperner Theory: Optimal orientations of vertex-multiplications of trees with diameter 4
Abstract
Koh and Tay proved a fundamental classification of G vertex-multiplications into three classes C0, C1 and C2. They also showed that any vertex-multiplication of a tree with diameter at least 3 does not belong to the class C2. Of interest, G vertex-multiplications are extensions of complete n-partite graphs and Gutin characterised complete bipartite graphs with an ingenious use of Sperner's Theorem. In this paper, we investigate vertex-multiplications of trees with diameter 4 in C0 (or C1) and exhibit its intricate connections with problems in Sperner Theory, thereby extending Gutin's approach. Let s denote the vertex-multiplication of the central vertex. We almost completely characterise the case of even s and give a complete characterisation for the case of odd s 3.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.