Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

An obstruction to Ore-heavy mass localization


This page preserves an earlier research route and its local standing. The completed threshold proof is in the solution note.

The construction below tests an auxiliary Ore-heavy endpoint lemma; it leaves the C7C_7 color bound open.

The Ore-heavy endpoint set

S0={v:some edge vu has d(v)+d(u)>n}S_0=\{v:\text{some edge }vu\text{ has }d(v)+d(u)>n\}

need not contain half the vertices of a super-Turan graph.

A finite simple-graph construction

For an integer k≥3k\ge3, use n=54kn=54k vertices:

  • a clique ZZ of order 24k24k, partitioned into three sets ZiZ_i of size 8k8k;
  • an independent set SS, partitioned into three sets SiS_i of size 4k4k;
  • a complete six-partite graph RR, with parts of size 3k3k.

Add all RR-SS edges and all SiS_i-ZiZ_i edges, and no others. The vertex degrees are

dR=27k,dS=26k,dZ=28k−1.d_R=27k,\qquad d_S=26k,\qquad d_Z=28k-1.

Thus exactly the edges inside ZZ have endpoint-degree sum greater than 54k54k: their sum is 56k−2>54k56k-2>54k, whereas the sums on RR,RS,SiZiRR,RS,S_iZ_i are respectively 54k,53k,54k−154k,53k,54k-1. Consequently

∣S0∣=24k=4n/9<n/2.|S_0|=24k=4n/9<n/2.

Nevertheless

e(G)=(24k2)+15(3k)2+(18k)(12k)+3(8k)(4k)=735k2−12k=n2/4+6k(k−2)>n2/4.\begin{aligned} e(G)&=\binom{24k}{2}+15(3k)^2+(18k)(12k)+3(8k)(4k)\\ &=735k^2-12k =n^2/4+6k(k-2)>n^2/4. \end{aligned}

This is an unbounded-order obstruction, not a floating-point example.

Weighted formulation and its limitation

The corresponding twelve-type template has three looped, mutually joined ZiZ_i of weight 4/274/27, three independent SiS_i of weight 2/272/27, and six independent RR-parts of weight 1/181/18, joined as above. Its parameters are

dZ=14/27,dS=13/27,dR=1/2,q=245972=14+1486,w(S0)=4/9.d_Z=14/27,\quad d_S=13/27,\quad d_R=1/2,\qquad q=\frac{245}{972}=\frac14+\frac1{486},\quad w(S_0)=4/9.

This refutes both the weak conjecture w(S0)>1/2w(S_0)>1/2 and the stronger attempted analogue w(S0)≥1/2+q−1/4w(S_0)\ge1/2+\sqrt{q-1/4} of the triangle-vertex mass theorem.

It does not obstruct the unrestricted three-walk clique: every type pair has a two-walk. For Zi,RjZ_i,R_j, use SiS_i; for Zi,SjZ_i,S_j, use ZjZ_j; for Si,SjS_i,S_j and Ri,RjR_i,R_j, use respectively RR and SS; for Si,RjS_i,R_j, use a different RR-part. The ZZ-ZZ case is immediate. There are no isolated types, so all pairs also have three-walks. Every type is triangular. Therefore J23J_{23} is complete and its palette cost is ρ=q\rho=q, well above the desired q/2q/2.

The proved fact that S0S_0 is a three-walk clique remains valid. Its mass, however, cannot serve as a universal half-vertex certificate.