K6 and K6,6 sequence rank formula for four-dimensional rigidity

Let KnK_n be the complete graph and let FE(Kn)F\subseteq E(K_n). A proper {K6,K6,6}\{K_6,K_{6,6}\}-sequence is the sequence construction defined in the source using copies of K6K_6 and K6,6K_{6,6}; write CtC_{\leq t} for the union of its edge sets. Four-dimensional rank conjecture. The rank function of R4,n{\cal R}_{4,n} is

r(F)=min{FCtt:(C1,,Ct) is a proper {K6,K6,6}-sequence in Kn}r(F)=\min\{|F\cup C_{\leq t}|-t:(C_1,\ldots,C_t)\text{ is a proper }\{K_6,K_{6,6}\}\text{-sequence in }K_n\}

for every FE(Kn)F\subseteq E(K_n). The conjecture is motivated by the failure of unique maximality for R4,n{\cal R}_{4,n}, and the source gives no resolution.

Sources & referencesView supporting material

Primary source

Katie Clinch, Bill Jackson and Shin-ichi Tanigawa, “Abstract 3-Rigidity and Bivariate C_2^1-Splines II: Combinatorial Characterization”, arXiv:1911.00207 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.