Inside-out polytopes & a tale of seven polynomials Matthias - - PowerPoint PPT Presentation

Inside-out polytopes & a tale of seven polynomials

Matthias Beck, San Francisco State University Thomas Zaslavsky, Binghamton University (SUNY) math.sfsu.edu/beck/ arXiv: math.CO/0309330 & math.CO/0309331 & . . .

Chromatic polynomials of graphs

Γ = (V, E) – graph (without loops) Proper k-coloring of Γ : mapping x : V → {1, 2, . . . , k} such that xi = xj if there is an edge ij Theorem (Birkhoff 1912, Whitney 1932) χΓ(k) := # (proper k-colorings of Γ) is a monic polynomial in k of degree |V |.

Inside-Out Polytopes Matthias Beck 2

Chromatic polynomials of graphs

Γ = (V, E) – graph (without loops) Proper k-coloring of Γ : mapping x : V → {1, 2, . . . , k} such that xi = xj if there is an edge ij Theorem (Birkhoff 1912, Whitney 1932) χΓ(k) := # (proper k-colorings of Γ) is a monic polynomial in k of degree |V |. Theorem (Stanley 1973) (−1)|V |χΓ(−k) equals the number of pairs (α, x) consisting of an acyclic orientation α of Γ and a compatible k-coloring. In particular, (−1)|V |χΓ(−1) equals the number of acyclic orientations of Γ. (An orientation α of Γ and a k -coloring x are compatible if xj ≥ xi whenever there is an edge oriented from i to j. An orientation is acyclic if it has no directed cycles.)

Inside-Out Polytopes Matthias Beck 2

Flow polynomials

Nowhere-zero A-flow on a graph Γ = (V, E) : mapping x : E → A \ {0} (A an abelian group) such that for every node v ∈ V

• h(e)=v

x(e) =

• t(e)=v

x(e) h(e) := head t(e) := tail

• f the edge e in a (fixed) orientation of Γ

Inside-Out Polytopes Matthias Beck 3

Flow polynomials

Nowhere-zero A-flow on a graph Γ = (V, E) : mapping x : E → A \ {0} (A an abelian group) such that for every node v ∈ V

• h(e)=v

x(e) =

• t(e)=v

x(e) h(e) := head t(e) := tail

• f the edge e in a (fixed) orientation of Γ

Nowhere-zero k-flow : Z-flow with values in {1, 2, . . . , k − 1}

Inside-Out Polytopes Matthias Beck 3

Flow polynomials

Nowhere-zero A-flow on a graph Γ = (V, E) : mapping x : E → A \ {0} (A an abelian group) such that for every node v ∈ V

• h(e)=v

x(e) =

• t(e)=v

x(e) h(e) := head t(e) := tail

• f the edge e in a (fixed) orientation of Γ

Nowhere-zero k-flow : Z-flow with values in {1, 2, . . . , k − 1} Theorem (Tutte 1954) ϕΓ(|A|) := # (nowhere-zero A-flows) is a polynomial in |A|. (Kochol 2002) ϕΓ(k) := # (nowhere-zero k-flows) is a polynomial in k.

Inside-Out Polytopes Matthias Beck 3

(Weak) semimagic squares

Hn(t) – number of nonnegative integral n × n-matrices in which every row and column sums to t 1 1 2 2 1 1 1 2 1

Inside-Out Polytopes Matthias Beck 4

(Weak) semimagic squares

Hn(t) – number of nonnegative integral n × n-matrices in which every row and column sums to t 1 1 2 2 1 1 1 2 1 Theorem (Ehrhart, Stanley 1973, conjectured by Anand-Dumir-Gupta 1966) Hn(t) is a polynomial in t of degree (n − 1)2 satisfying Hn(0) = 1, Hn(−1) = Hn(−2) = · · · = Hn(−n + 1) = 0, and Hn(−n − t) = (−1)n−1Hn(t) .

Inside-Out Polytopes Matthias Beck 4

(Weak) semimagic squares

Hn(t) – number of nonnegative integral n × n-matrices in which every row and column sums to t 1 1 2 2 1 1 1 2 1 Theorem (Ehrhart, Stanley 1973, conjectured by Anand-Dumir-Gupta 1966) Hn(t) is a polynomial in t of degree (n − 1)2 satisfying Hn(0) = 1, Hn(−1) = Hn(−2) = · · · = Hn(−n + 1) = 0, and Hn(−n − t) = (−1)n−1Hn(t) . What about “classical” magic squares?

Inside-Out Polytopes Matthias Beck 4

Ehrhart (quasi-)polynomials

P ⊂ Rd – convex rational polytope For t ∈ Z>0 let EhrP(t) := #

• P ∩ 1

tZd

Inside-Out Polytopes Matthias Beck 5

Ehrhart (quasi-)polynomials

P ⊂ Rd – convex rational polytope For t ∈ Z>0 let EhrP(t) := #

• P ∩ 1

tZd

Theorem (Ehrhart 1962) EhrP(t) is a quasipolynomial in t of degree dim P with leading term vol P (normalized to aff P ∩ Zd ) and constant term EhrP(0) = χ(P) = 1. (Macdonald 1971) (−1)dim P EhrP(−t) enumerates the interior lattice points in tP. (A quasipolynomial is an expression cd(t) td + · · · + c1(t) t + c0(t) where c0, . . . , cd are periodic functions in t.)

Inside-Out Polytopes Matthias Beck 5

Characteristic polynomials of hyperplane arrangements

H ⊂ Rd – arrangement of affine hyperplanes L(H) := S : S ⊆ H and S = ∅

• , ordered by reverse inclusion

Inside-Out Polytopes Matthias Beck 6

Characteristic polynomials of hyperplane arrangements

H ⊂ Rd – arrangement of affine hyperplanes L(H) := S : S ⊆ H and S = ∅

• , ordered by reverse inclusion

M¨

• bius function µ(r, s) :=

         if r ≤ s, 1 if r = s, −

• r≤u<s

µ(r, u) if r < s. Characteristic polynomial pH(λ) :=

• s∈L(H)

µ

• Rd, s
• λdim s

Inside-Out Polytopes Matthias Beck 6

Characteristic polynomials of hyperplane arrangements

H ⊂ Rd – arrangement of affine hyperplanes L(H) := S : S ⊆ H and S = ∅

• , ordered by reverse inclusion

M¨

• bius function µ(r, s) :=

         if r ≤ s, 1 if r = s, −

• r≤u<s

µ(r, u) if r < s. Characteristic polynomial pH(λ) :=

• s∈L(H)

µ

• Rd, s
• λdim s

Theorem (Zaslavsky 1975) If Rd ∈ H then the number of regions into which a hyperplane arrangement H divides Rd is (−1)dpH(−1).

Inside-Out Polytopes Matthias Beck 6

Graph coloring a la Ehrhart

χK2(k) = k(k − 1) ...

1 k + 1 k +

1 = x 2

x

2

K

Inside-Out Polytopes Matthias Beck 7

Graph coloring a la Ehrhart

χK2(k) = k(k − 1) ...

1 k + 1 k +

1 = x 2

x

2

K

χΓ(k) = #

• (0, 1)V \
• H(Γ)
• ∩

1 k + 1ZV

• Inside-Out Polytopes

Matthias Beck 7

Stanley’s Theorem a la Ehrhart

1 k + 1 k +

1 = x 2

x

2

K

χΓ(k) = #

• (0, 1)V \ H(Γ)
• ∩

1 k+1ZV

Write (0, 1)V \

• H(Γ) =
• j

P◦

j , then by Ehrhart-Macdonald reciprocity

(−1)|V |χΓ(−k) =

• j

EhrPj(k − 1)

Inside-Out Polytopes Matthias Beck 8

Stanley’s Theorem a la Ehrhart

1 k + 1 k +

1 = x 2

x

2

K

χΓ(k) = #

• (0, 1)V \ H(Γ)
• ∩

1 k+1ZV

Write (0, 1)V \

• H(Γ) =
• j

P◦

j , then by Ehrhart-Macdonald reciprocity

(−1)|V |χΓ(−k) =

• j

EhrPj(k − 1) Greene’s observation region of H(Γ) ⇐ ⇒ acyclic orientation of Γ xi < xj ⇐ ⇒ i − → j

Inside-Out Polytopes Matthias Beck 8

Chromatic polynomials of signed graphs

Σ – signed graph (without loops): each edge is labelled + or − Proper k-coloring of Σ : mapping x : V → {−k, −k + 1, . . . , k} such that, if edge ij has sign ǫ then xi = ǫxj

Inside-Out Polytopes Matthias Beck 9

Chromatic polynomials of signed graphs

Σ – signed graph (without loops): each edge is labelled + or − Proper k-coloring of Σ : mapping x : V → {−k, −k + 1, . . . , k} such that, if edge ij has sign ǫ then xi = ǫxj Theorem (Zaslavsky 1982) χΣ(2k + 1) := # (proper k-colorings of Σ) and χ∗

Σ(2k) := # (proper zero-free k-colorings of Σ) are monic polynomials of

degree |V |. The number of compatible pairs (α, x) consisting of an acyclic

• rientation α and a k-coloring x of Σ is equal to (−1)|V |χΣ(−(2k + 1)).

The number in which x is zero-free equals (−1)|V |χ∗

Σ(−2k). In particular,

(−1)|V |χΣ(−1) equals the number of acyclic orientations of Σ.

Inside-Out Polytopes Matthias Beck 9

Signed-graph coloring a la Ehrhart

x1 = 1/2 x 2 = 1/2 x1 + x 2 = 1 x1 = x 2 x1 = 1/2 x 2 = 1/2 x1 = x 2 (1,0) (0,1) (0,0) (1,1) (1,0) (0,0) (1,1) (0,1) + x 2 = 1 x1 − + − − pmk2o

Theorem χΣ(2k + 1) and χ∗

Σ(2k) are two halves of one inside-out

quasipolynomial.

Inside-Out Polytopes Matthias Beck 10

Signed-graph coloring a la Ehrhart

x1 = 1/2 x 2 = 1/2 x1 + x 2 = 1 x1 = x 2 x1 = 1/2 x 2 = 1/2 x1 = x 2 (1,0) (0,1) (0,0) (1,1) (1,0) (0,0) (1,1) (0,1) + x 2 = 1 x1 − + − − pmk2o

Theorem χΣ(2k + 1) and χ∗

Σ(2k) are two halves of one inside-out

quasipolynomial. Open problem Is there a combinatorial interpretation of χ∗

Σ(−1)?

Inside-Out Polytopes Matthias Beck 10

Flow polynomials revisited

ϕΓ(k) := # (nowhere-zero k-flows) ϕΓ(|A|) := # (nowhere-zero A-flows) Theorem (−1)|E|−|V |+c(Γ)ϕΓ(−k) equals the number of pairs (τ, x) consisting of a totally cyclic orientation τ and a compatible (k + 1) - flow x. In particular, the constant term ϕΓ(0) equals the number of totally cyclic orientations of Γ. (An orientation of Γ is totally cyclic if every edge lies in a coherent circle, that is, where the edges are oriented in a consistent direction around the

• circle. A totally cyclic orientation τ and a flow x are compatible if x ≥ 0

when it is expressed in terms of τ.)

Inside-Out Polytopes Matthias Beck 11

Flow polynomials revisited

ϕΓ(k) := # (nowhere-zero k-flows) ϕΓ(|A|) := # (nowhere-zero A-flows) Theorem (−1)|E|−|V |+c(Γ)ϕΓ(−k) equals the number of pairs (τ, x) consisting of a totally cyclic orientation τ and a compatible (k + 1) - flow x. In particular, the constant term ϕΓ(0) equals the number of totally cyclic orientations of Γ. (An orientation of Γ is totally cyclic if every edge lies in a coherent circle, that is, where the edges are oriented in a consistent direction around the

• circle. A totally cyclic orientation τ and a flow x are compatible if x ≥ 0

when it is expressed in terms of τ.) Corollary ϕΓ(0) = (−1)|E|−|V |+c(Γ)ϕΓ(−1) ∃ analogous theorems for signed graphs

Inside-Out Polytopes Matthias Beck 11

Open problems

Find a formula for, or a combinatorial interpretation of, the leading coefficient of ϕΓ.

Inside-Out Polytopes Matthias Beck 12

Open problems

Find a formula for, or a combinatorial interpretation of, the leading coefficient of ϕΓ. Is there a combinatorial interpretation of ϕΓ(−k) for k ≥ 2?

Inside-Out Polytopes Matthias Beck 12

Open problems

Find a formula for, or a combinatorial interpretation of, the leading coefficient of ϕΓ. Is there a combinatorial interpretation of ϕΓ(−k) for k ≥ 2? For some graphs, both ϕΓ and ϕΓ have integral coefficients and ϕΓ is a multiple of ϕΓ. Is there a general reason for these facts?

Inside-Out Polytopes Matthias Beck 12

Inside-out counting functions

Inside-out polytope : (P, H) Multiplicity of x ∈ Rd : mP,H(x) :=

• # closed regions of H in P that contain x

if x ∈ P, if x / ∈ P Closed Ehrhart quasipolynomial EP,H(t) :=

• x∈1

tZd

mP,H(x) Open Ehrhart quasipolynomial E◦

P,H(t) := #

1

tZd ∩ [P \ H]

• Inside-Out Polytopes

Matthias Beck 13

Basic inside-out results

Theorem If (P, H) is a closed, full-dimensional, rational inside-out polytope, then EP,H(t) and E◦

P◦,H(t) are quasipolynomials in t of degree dim P with

leading term vol P , and with constant term EP,H(0) equal to the number

• f regions of (P, H). Furthermore,

E◦

P◦,H(t) = (−1)dEP,H(−t).

Inside-Out Polytopes Matthias Beck 14

Basic inside-out results

Theorem If (P, H) is a closed, full-dimensional, rational inside-out polytope, then EP,H(t) and E◦

P◦,H(t) are quasipolynomials in t of degree dim P with

leading term vol P , and with constant term EP,H(0) equal to the number

• f regions of (P, H). Furthermore,

E◦

P◦,H(t) = (−1)dEP,H(−t).

Theorem (P, H) is a closed, full-dimensional, rational inside-out polytope, then E◦

P,H(t) =

• u∈L(H)

µ(Rd, u) EhrP∩u(t), and if H is transverse to P EP,H(t) =

• u∈L(H)

|µ(Rd, u)| EhrP∩u(t). (H is transverse to P if every flat u ∈ L(H) that intersects P also intersects P ◦, and P does not lie in any of the hyperplanes of H.)

Inside-Out Polytopes Matthias Beck 14

(Strong) magic squares

Magn(t) – number of nonnegative integral n × n-matrices with distinct entries in which every row and column sums to t 4 3 8 9 5 1 2 7 6

Inside-Out Polytopes Matthias Beck 15

(Strong) magic squares

Magn(t) – number of nonnegative integral n × n-matrices with distinct entries in which every row and column sums to t 4 3 8 9 5 1 2 7 6 Corollary Magn(t) is a quasipolynomial in t of degree n − 2n − 1. Open problem Can anything be said about the period of Magn? Even in the weak case, do we ever get a polynomial?

Inside-Out Polytopes Matthias Beck 15

Enumeration of integer points with distinct entries

P ⊂ Rd – rational convex polytope, transverse to H := H[Kd]aff P – arrangement corresponding to Kd, induced on aff P

Inside-Out Polytopes Matthias Beck 16

Enumeration of integer points with distinct entries

P ⊂ Rd – rational convex polytope, transverse to H := H[Kd]aff P – arrangement corresponding to Kd, induced on aff P Theorem The number E◦

P◦,H(t) of integer points in tP◦ with distinct entries

is a quasipolynomial with constant term equal to the number of permutations

• f [d] that are realizable in P .

Furthermore, (−1)dim sE◦

P◦,H(−t) =

EP,H(t) := the number of pairs (x, σ) consisting of an integer point x ∈ tP and a compatible P-realizable permutation σ of [d]. (The point x ∈ Rd and the permutation τ are compatible if xτ1 < xτ2 < · · · < xτd. τ is realizable in X if there exists a compatible x ∈ X.)

Inside-Out Polytopes Matthias Beck 16

Enumeration of integer points with distinct entries

P ⊂ Rd – rational convex polytope, transverse to H := H[Kd]aff P – arrangement corresponding to Kd, induced on aff P Theorem The number E◦

P◦,H(t) of integer points in tP◦ with distinct entries

is a quasipolynomial with constant term equal to the number of permutations

• f [d] that are realizable in P .

Furthermore, (−1)dim sE◦

P◦,H(−t) =

EP,H(t) := the number of pairs (x, σ) consisting of an integer point x ∈ tP and a compatible P-realizable permutation σ of [d]. (The point x ∈ Rd and the permutation τ are compatible if xτ1 < xτ2 < · · · < xτd. τ is realizable in X if there exists a compatible x ∈ X.) Applications (strong) magic squares, rectangles, cubes, graphs, ...

Inside-Out Polytopes Matthias Beck 16

Open problems

When does H[Kd] change the denominator of P?

Inside-Out Polytopes Matthias Beck 17

Open problems

When does H[Kd] change the denominator of P? If P has integral vertices then EhrP is a polynomial. What conditions on P ensure that EP,H[Kd] is also a polynomial? (It need not be: Consider the line segment P from (0, 1) to (1, 0) and let H = {x1 = x2}.)

Inside-Out Polytopes Matthias Beck 17

Open problems

When does H[Kd] change the denominator of P? If P has integral vertices then EhrP is a polynomial. What conditions on P ensure that EP,H[Kd] is also a polynomial? (It need not be: Consider the line segment P from (0, 1) to (1, 0) and let H = {x1 = x2}.) The inside-out Ehrhart quasipolynomials for some magic and latin squares have striking symmetries (coefficients alternate in sign, the polynomials factor nicely, etc.). Explain.

Inside-Out Polytopes Matthias Beck 17

Open problems

When does H[Kd] change the denominator of P? If P has integral vertices then EhrP is a polynomial. What conditions on P ensure that EP,H[Kd] is also a polynomial? (It need not be: Consider the line segment P from (0, 1) to (1, 0) and let H = {x1 = x2}.) The inside-out Ehrhart quasipolynomials for some magic and latin squares have striking symmetries (coefficients alternate in sign, the polynomials factor nicely, etc.). Explain. The inside-out Ehrhart quasipolynomials for some magic and latin squares have much lower periods than predicted by their denominators. Explain.

Inside-Out Polytopes Matthias Beck 17

Open problems

When does H[Kd] change the denominator of P? If P has integral vertices then EhrP is a polynomial. What conditions on P ensure that EP,H[Kd] is also a polynomial? (It need not be: Consider the line segment P from (0, 1) to (1, 0) and let H = {x1 = x2}.) The inside-out Ehrhart quasipolynomials for some magic and latin squares have striking symmetries (coefficients alternate in sign, the polynomials factor nicely, etc.). Explain. The inside-out Ehrhart quasipolynomials for some magic and latin squares have much lower periods than predicted by their denominators. Explain. Compute Mag4, Mag5, . . . (possibly using LattE and the M¨

• bius function
• f the intersection lattice of H[Kd]).

Inside-Out Polytopes Matthias Beck 17

Latin squares and beyond

Covering cluster (X, L) – a finite set X of points together with a family L ⊆ P(X) of lines Latin labelling of (X, L) – assignment of integers to X such that all entries in a line are distinct.

Inside-Out Polytopes Matthias Beck 18

Latin squares and beyond

Covering cluster (X, L) – a finite set X of points together with a family L ⊆ P(X) of lines Latin labelling of (X, L) – assignment of integers to X such that all entries in a line are distinct. To make counting fun, we restrict the entries to the set (0, t) . This corresponds to the inside-out polytope

• [0, 1]X, H[ΓL]
• , where

ΓL =

• L∈L
• KL. (Every graph is isomorphic to one of those.)

Inside-Out Polytopes Matthias Beck 18

Latin squares and beyond

Covering cluster (X, L) – a finite set X of points together with a family L ⊆ P(X) of lines Latin labelling of (X, L) – assignment of integers to X such that all entries in a line are distinct. To make counting fun, we restrict the entries to the set (0, t) . This corresponds to the inside-out polytope

• [0, 1]X, H[ΓL]
• , where

ΓL =

• L∈L
• KL. (Every graph is isomorphic to one of those.)

Example : latin rectangle – lines are rows & columns, ΓL = Km × Kn. Slightly more general are (partial) latin orthotopes with ΓL = Km1 × · · · × Kmj (a “Hamming graph”).

Inside-Out Polytopes Matthias Beck 18

Stanley’s Theorem and latinity

Theorem The number L◦(t) of latin labellings of (X, L) with values in (0, t) is a monic polynomial of degree |X| with constant term equal to the number

• f acyclic orientations of ΓL. Furthermore, (−1)|X|L◦(−t) enumerates pairs

consisting of an acyclic orientation of ΓL and a compatible latin labelling with values in [0, t].

Inside-Out Polytopes Matthias Beck 19

Stanley’s Theorem and latinity

Theorem The number L◦(t) of latin labellings of (X, L) with values in (0, t) is a monic polynomial of degree |X| with constant term equal to the number

• f acyclic orientations of ΓL. Furthermore, (−1)|X|L◦(−t) enumerates pairs

consisting of an acyclic orientation of ΓL and a compatible latin labelling with values in [0, t]. Magilatin squares – additional summation condition on the lines, e.g.

• set all line sums equal to each other;
• set all line sums equal to t.

Inside-Out Polytopes Matthias Beck 19

Stanley’s Theorem and latinity

Theorem The number L◦(t) of latin labellings of (X, L) with values in (0, t) is a monic polynomial of degree |X| with constant term equal to the number

• f acyclic orientations of ΓL. Furthermore, (−1)|X|L◦(−t) enumerates pairs

consisting of an acyclic orientation of ΓL and a compatible latin labelling with values in [0, t]. Magilatin squares – additional summation condition on the lines, e.g.

• set all line sums equal to each other;
• set all line sums equal to t.

Example : latin squares, with t = n+1

2

• Note that the hyperplane arrangement gets more complicated, namely

H[ΓL]s , where s is the subspace of RX determined by the line sum conditions.

Inside-Out Polytopes Matthias Beck 19

Open problem

The magic subspace of the covering cluster ([d], L) is defined by all line sums given by L being equal. A permutation σ of [d] defines a reverse dominance order on the power set P([d]) by L σ L′ if, when L and L′ are written in decreasing order according to σ , say L = {σj1, . . . , σjl} where j1 > · · · > jl and L′ = {σj′

1, . . . , σj′ l′} where j′ 1 > · · · > j′ l′, then l ≤ l′ and j1 ≤ j′ 1, . . . , jl ≤ j′ l.

Conjecture A permutation σ of [d] is realizable by a positive point in the magic subspace of the covering cluster ([d], L) if and only if L is an antichain in the reverse dominance order due to σ.

Inside-Out Polytopes Matthias Beck 20

Antimagic

f1, . . . , fm ∈ (Rd)∗ – linear forms A◦(t) := # integer points x ∈ (0, t)d such that fj(x) = fk(x) if j = k

Inside-Out Polytopes Matthias Beck 21

Antimagic

f1, . . . , fm ∈ (Rd)∗ – linear forms A◦(t) := # integer points x ∈ (0, t)d such that fj(x) = fk(x) if j = k Inside-out interpretation: f(x) := (f1, . . . , fm)(x) / ∈ H[Km] ⊆ Rm Pullback H[Km]♯ ⊆ Rd obtained from f −1(h) for all h ∈ H[Km] Antimagic : x ∈ Rd \ H[Km]♯

Inside-Out Polytopes Matthias Beck 21

Antimagic

f1, . . . , fm ∈ (Rd)∗ – linear forms A◦(t) := # integer points x ∈ (0, t)d such that fj(x) = fk(x) if j = k Inside-out interpretation: f(x) := (f1, . . . , fm)(x) / ∈ H[Km] ⊆ Rm Pullback H[Km]♯ ⊆ Rd obtained from f −1(h) for all h ∈ H[Km] Antimagic : x ∈ Rd \ H[Km]♯ Examples : antimagic graphs and relatives (bidirected antimagic graphs, node antimagic, total graphical antimagic), antimagic squares, cubes, etc.

Inside-Out Polytopes Matthias Beck 21

Open problems

Is there a combinatorial interpretation of the regions of H[Km]♯?

Inside-Out Polytopes Matthias Beck 22

Open problems

Is there a combinatorial interpretation of the regions of H[Km]♯? What is the intersection-lattice structure of H[Km]♯?

Inside-Out Polytopes Matthias Beck 22

Open problems

Is there a combinatorial interpretation of the regions of H[Km]♯? What is the intersection-lattice structure of H[Km]♯? Prove that every graph except K2 is (strongly) antimagic, i.e., admits an antimagic labelling using the numbers 1, 2, . . . , |E|.

Inside-Out Polytopes Matthias Beck 22

Open problems

Is there a combinatorial interpretation of the regions of H[Km]♯? What is the intersection-lattice structure of H[Km]♯? Prove that every graph except K2 is (strongly) antimagic, i.e., admits an antimagic labelling using the numbers 1, 2, . . . , |E|. If that’s too hard, try trees.

Inside-Out Polytopes Matthias Beck 22