Generalized Mycielski Construction

• Generalized Mycielski Construction is a graph transformation that extends the classical Mycielskian by adding multiple clone layers capped with an apex while preserving base graph adjacencies.
• It serves as a key tool for analyzing chromatic numbers, topological lower bounds, and zero-error capacities through a structured lift-and-cap mechanism.
• Its variants, including directed and quantum forms, and related constructs like the great shadow, offer diverse applications and open avenues for research in graph theory.

The generalized Mycielski construction is a family of graph transformations that extends the classical Mycielskian by replacing the single clone layer with a stack of lift layers capped by an apex. In the now-standard undirected form, the generalized Mycielskian $M_r(G)$ of a graph $G$ has vertex set $V(G)\times\{0,1,\dots,r-1\}\cup\{z\}$, contains a copy of $G$ in layer $0$, reproduces the adjacencies of $G$ between consecutive layers, and joins the apex $z$ to every vertex in the top layer. The case $r=2$ is the classical Mycielskian, and $M_r(K_2)\cong C_{2r+1}$. This layered construction has been studied for chromatic and topological lower bounds, zero-error information-theoretic parameters, linear-algebraic graph bounds, orientation parameters, immersion theory, and several nonclassical analogues (Csonka et al., 2023, Müller et al., 2017, Csonka, 13 Jul 2025).

1. Definition, special cases, and notational conventions

For a simple undirected graph $G$, the generalized Mycielskian $G$0 is defined by

$G$1

with edges

$G$2

Layer $G$3 induces a copy of $G$4; for each $G$5, the bipartite graph between layers $G$6 and $G$7 mirrors the adjacencies of $G$8; and the apex is adjacent exactly to the top layer. The classical Mycielskian is recovered at $G$9, so $V(G)\times\{0,1,\dots,r-1\}\cup\{z\}$0. A canonical special case is $V(G)\times\{0,1,\dots,r-1\}\cup\{z\}$1, which makes odd cycles the simplest generalized Mycielski graphs (Csonka et al., 2023, Csonka, 13 Jul 2025).

The classical $V(G)\times\{0,1,\dots,r-1\}\cup\{z\}$2 construction preserves clique number and raises chromatic number by one: $V(G)\times\{0,1,\dots,r-1\}\cup\{z\}$3 For general $V(G)\times\{0,1,\dots,r-1\}\cup\{z\}$4, the chromatic behavior is more delicate. Many graphs satisfy $V(G)\times\{0,1,\dots,r-1\}\cup\{z\}$5 for all $V(G)\times\{0,1,\dots,r-1\}\cup\{z\}$6, but there are exceptions; one explicit example is $V(G)\times\{0,1,\dots,r-1\}\cup\{z\}$7 (Csonka et al., 2023, Müller et al., 2017).

Notation is not uniform across the literature. Several papers use $V(G)\times\{0,1,\dots,r-1\}\cup\{z\}$8 for the classical case, whereas work on dependent arcs and cover graphs uses $V(G)\times\{0,1,\dots,r-1\}\cup\{z\}$9 with $G$0 equal to the ordinary Mycielskian, and immersion-theoretic work writes $G$1, where $G$2 is classical and $G$3 is $G$4 with one universal vertex added (Lai et al., 2012, Collins et al., 2021). This indexing shift is purely conventional but important when comparing formulas.

2. Chromatic and topological role

The generalized construction is central in topological lower bounds for graph coloring. Müller and Stehlík consider the classes $G$5 obtained by starting from $G$6 and iterating generalized Mycielski operations with arbitrary parameters $G$7. Stiebitz’s theorem states that if $G$8, then

$G$9

Their proof deduces this from a version of Ky Fan’s combinatorial lemma, and they further show that Stiebitz’s theorem is equivalent to the Borsuk–Ulam theorem. In this sense, generalized Mycielski graphs form a discrete family that exactly captures a classical topological obstruction to low chromatic number (Müller et al., 2017).

A complementary formulation appears in the box-complex approach. Simons, Tardif, and Wehlau define classes $0$0 recursively by $0$1 and $0$2, and prove that for every graph $0$3,

$0$4

is the largest $0$5 for which some generalized Mycielski graph $0$6 admits a homomorphism to $0$7. They thus replace Borsuk graphs by finite generalized Mycielski test graphs in the measurement of the coindex of the box complex. The same paper introduces a polynomial-time solvable linear system—the signature system—whose unsolvability implies $0$8, while solvability implies $0$9 (Simons et al., 2016).

These results separate two phenomena that coincide for the classical Mycielskian but not for arbitrary $G$0. On the one hand, iterating generalized Mycielski steps from $G$1 still forces large chromatic number in the sense of Stiebitz’s theorem. On the other hand, for a fixed input $G$2, a single step $G$3 with $G$4 need not increase $G$5. This distinction is fundamental in later work on capacity and spectral parameters, where $G$6 often behaves rigidly and $G$7 remains open.

3. Capacity, theta-type invariants, and asymptotic parameters

Csonka and Simonyi study the generalized construction from the distinguishability-graph viewpoint of zero-error information theory. Using the OR-product,

$G$8

they define the nonlogarithmic Shannon OR-capacity

$G$9

Their main theorem for the standard Mycielski construction states that if $z$0 attains its OR-capacity at finite length, meaning

$z$1

for some $z$2, then

$z$3

The proof combines a large-clique construction for powers of $z$4 with an embedding lemma $z$5. For $z$6, this recovers the exact equality $z$7, since $z$8. For generalized Mycielskians, the odd-cycle case remains tractable because $z$9, and Bohman–Holzman’s construction implies $r=2$0 for all $r=2$1. By contrast, for $r=2$2 the paper proves that the natural “lift-and-apex” strategy cannot produce the required clique structure, so a general capacity-increase theorem for $r=2$3 remains open (Csonka et al., 2023).

The same paper proves that the complementary Lovász theta number is completely determined by its value on the original graph under the classical Mycielski step. Writing $r=2$4, one has

$r=2$5

This is proved twice: first through a lifted strict vector coloring, which yields a cubic equation for the new value, and second through Lovász’s spectral characterization. Special cases include $r=2$6 and $r=2$7 (Csonka et al., 2023).

The fractional chromatic number exhibits an analogous value-determination phenomenon. Larsen–Propp–Ullman showed for $r=2$8 that

$r=2$9

and Tardif generalized this to all $M_r(K_2)\cong C_{2r+1}$0: $M_r(K_2)\cong C_{2r+1}$1 Tamura proves that the complementary fractional Haemers bound satisfies the same Tardif-type law whenever it equals the clique number: $M_r(K_2)\cong C_{2r+1}$2 More generally,

$M_r(K_2)\cong C_{2r+1}$3

with equality proved for cliques and for every graph satisfying the clique-equality hypothesis. No counterexample is known to the conjecture that this exact formula holds for all graphs and fields (Csonka, 13 Jul 2025).

These formulas place generalized Mycielskians inside the asymptotic-spectrum program. Csonka and Simonyi explicitly frame $M_r(K_2)\cong C_{2r+1}$4, $M_r(K_2)\cong C_{2r+1}$5, and Mycielski-determined parameters through classes such as $M_r(K_2)\cong C_{2r+1}$6, $M_r(K_2)\cong C_{2r+1}$7, and $M_r(K_2)\cong C_{2r+1}$8, and ask whether broader systematic relations hold between asymptotic-spectrum parameters and Mycielski determination (Csonka et al., 2023).

4. Other graph invariants and structural consequences

The generalized construction has also been used to study invariants far removed from chromatic theory. For boxicity, Adiga, Chandran, and Sivadasan prove the monotonicity

$M_r(K_2)\cong C_{2r+1}$9

and, more precisely, if $G$0 has $G$1 universal vertices, then

$G$2

while

$G$3

with the stronger upper bound

$G$4

when $G$5 is zero or odd. They compute

$G$6

and extend the universal-vertex lower bound to every $G$7. They also show that for bipartite $G$8,

$G$9

and for arbitrary $G$00 and $G$01,

$G$02

This reduces much of the generalized problem to the cases $G$03 and $G$04 (Kamibeppu, 2013).

In orientation theory, Wang, Chang, and Tian examine the minimum number $G$05 of dependent arcs over all acyclic orientations of $G$06, where an arc is dependent if reversing it creates a directed cycle. In their indexing, the generalized Mycielski graph $G$07 has classical case $G$08. They prove that

$G$09

equivalently, $G$10 is a cover graph precisely when $G$11 is bipartite. They also give sufficient conditions for $G$12, prove additive lower bounds such as $G$13 for triangle-free $G$14 with $G$15, and obtain parallel results for the edge-deletion parameter $G$16 leading to a cover graph. Odd cycles satisfy $G$17 and $G$18 (Lai et al., 2012).

For clique immersions, Burger and Andreae prove that generalized Mycielskians increase immersion number by at least one: $G$19 Their proof uses the “distinct neighbor property” of $G$20-immersions to route edge-disjoint paths from the base layer to the root. The lower bound is best possible for $G$21 and for $G$22, where $G$23. In other families it is not sharp: for $G$24 and $G$25, $G$26, while for cycles $G$27 with $G$28, $G$29 at $G$30 and $G$31 for $G$32 (Collins et al., 2021).

5. Directed and quantum generalizations

The directed version replaces graphs by digraphs and preserves orientations between adjacent layers. For a digraph $G$33, the generalized directed Mycielskian $G$34 has the same layered vertex set $G$35, with arcs inside layer $G$36 copied from $G$37, arcs between consecutive layers following the original orientations in both relative directions, and arcs from the apex to the top layer. In the $G$38 case,

$G$39

and the apex has outward arcs to layer $G$40. Csonka and Simonyi prove the directed analogue of the finite-attainment theorem: if a digraph $G$41 attains its Sperner capacity at finite length, then

$G$42

The unique orientation of $G$43 is $G$44, and its Sperner capacity is $G$45, whereas other orientations of $G$46 have Sperner capacity $G$47. For generalized directed odd cycles $G$48, the inequality $G$49 is known for $G$50 and $G$51, and the extension to $G$52 remains open (Csonka et al., 2023).

A noncommutative extension appears in quantum graph theory. Bochniak, Chełstowski, Kasprzak, and Sołtan define the quantum Mycielskian $G$53 of a quantum graph $G$54 by

$G$55

equipped with a block adjacency operator that couples the master summand to the top layer and successive layers via the original adjacency $G$56. This reproduces the classical construction on commutative graphs. They prove that quantum isomorphism is preserved under $G$57, that $G$58 lifts to an action on $G$59, and that if $G$60 has no quantum twin vertices then, for every partition of unity $G$61,

$G$62

Under the same no-twin hypothesis, the quantum distinguishing number satisfies

$G$63

Their paper also notes earlier results showing that quantum clique number is invariant under $G$64, while quantum chromatic number can increase by at most $G$65 under the basic step $G$66 (Bochniak et al., 14 Feb 2025).

These extensions preserve the formal idea of a layered lift with an apex, but the preserved parameter depends strongly on context. In directed capacity theory the key object is the transitive clique number in OR-powers; in quantum graph theory it is symmetry under compact quantum groups. The construction is therefore better regarded as a schema—copy, lift, and cap—than as a single invariant-preserving mechanism.

6. Related Mycielski-like constructions, applications, and open problems

Several constructions are closely related to generalized Mycielskians without being identical to $G$67. The “great shadow” $G$68 duplicates each vertex $G$69 by a shadow $G$70 adjacent to $G$71 and to every neighbor of $G$72. Unlike the classical Mycielskian, this immediately creates triangles whenever $G$73 has an edge. DeJong, Lee, and Shields prove the sharp planarity criterion

$G$74

They motivate $G$75 by diode-and-switch keyboard circuits, where single-sided PCB routability is equivalent to planarity of the great shadow. In this variant, the Mycielski-type duplication mechanism is used not for chromatic amplification but for planar embeddability and circuit layout (Vimal, 14 May 2025).

The name “Mycielski” also appears in constructions that are not graph lifts. In topological MV-algebras, He and Li study the Hartman–Mycielski object $G$76, the MV-algebra of step functions $G$77 with the HM-topology. For every Hausdorff topological MV-algebra $G$78, the canonical embedding $G$79 identifies $G$80 with a closed subalgebra of a pathwise connected, locally pathwise connected topological MV-algebra. Bounded continuous pseudometrics and bounded continuous real-valued functions extend to $G$81 by integration, and the functor $G$82 preserves open surjections and quotients (Xie et al., 7 Jun 2026). In descriptive set theory, Mycielski-type theorems have been generalized from perfect squares to rectangles $G$83 or $G$84 whose sides are bodies of Miller or uniformly perfect trees, with sharp positive and negative results depending on whether the ambient largeness notion is category or measure (Michalski et al., 2019). These uses share the name and a “largeness-by-structured-lift” motif, but they are distinct from the graph-theoretic $G$85.

Within graph theory, several problems remain open. For $G$86, a capacity-increase theorem comparable to the $G$87 Shannon-capacity result is not known in general, and extending the explicit $G$88-formula from $G$89 to $G$90 is also open (Csonka et al., 2023). Tamura’s exact formula for the complementary fractional Haemers bound is proved only under the hypothesis $G$91, although no counterexample to the general conjecture is known (Csonka, 13 Jul 2025). In quantum symmetry theory, the status of quantum twin vertices for $G$92 and $G$93 is left open (Bochniak et al., 14 Feb 2025). In immersion theory, Burger and Andreae conjecture that for $G$94,

$G$95

(Collins et al., 2021). Csonka and Simonyi also ask whether

$G$96

is finite, a question they identify as equivalent to a well-known Ramsey-type problem (Csonka et al., 2023).

Across these variants and open directions, the generalized Mycielski construction remains a precise mechanism for transferring local adjacency data into a higher-layer object whose global parameters are often more rigid, sometimes universal, and frequently still only partially understood.