Wiki
Wiki

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

Updated

Walk cliques that dominate outside degrees


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

The color bound follows under the joint-clique and degree-domination hypotheses below. The three-walk clique theorem supplies a large three-walk clique, while the additional two-walk and domination properties remain to be established in general.

A dominating joint clique suffices

Use the finite weighted-support and palette conventions of random blow-ups. Suppose a set KK satisfies

(A2)xy>0,(A3)xy>0(x,y∈K),m=w(K)≥1/2,Dx≤m(x∉K),(1)(A^2)_{xy}>0,\quad (A^3)_{xy}>0\quad(x,y\in K), \qquad m=w(K)\ge1/2,\quad D_x\le m\quad(x\notin K), \tag{1}

where Dx=∑ywyAxyD_x=\sum_yw_yA_{xy} is the support degree. Diagonal conditions are included. Then, for arbitrary supported demands TT, of density qq,

Φ(J23;T)≥q−18+(m−12)2(32−m).(2)\boxed{\Phi(J_{23};T)\ge q-\frac18+(m-\tfrac12)^2(\tfrac32-m).} \tag{2}

In particular q>1/4q>1/4 implies Φ>q/2\Phi>q/2.

Put U=V∖KU=V\setminus K, u=1−mu=1-m, a=eT(K)a=e_T(K), and, for x∈Ux\in U,

gx=dKT(x),hx=dUT(x),dx=gx+hx.g_x=d_K^T(x),\qquad h_x=d_U^T(x),\qquad d_x=g_x+h_x.

The internal KK-types form a conflict clique. They also conflict with every cut type: for internal abab and cut kxkx, use two-walks from aa and bb to kk, appending kxkx to the latter. All cut types are active because their KK-endpoint is triangular.

In any compatible cut palette, the outside neighborhoods N(x)N(x) are pairwise disjoint. An intersection would supply a two-walk between the outside endpoints, while the KK-endpoints have a three-walk. Hence the dual assigning value one to internal types, value DxD_x to a cut type kxkx, and zero elsewhere is feasible:

Φ≥a+∫UgxDx dwx.\Phi\ge a+\int_Ug_xD_x\,dw_x.

Now dx≤Dx≤md_x\le D_x\le m and hx≤uh_x\le u, so

gx+hx/2−gxDx≤dx−dx2+hx(dx−1/2)≤1/4+u(m−1/2).\begin{aligned} g_x+h_x/2-g_xD_x &\le d_x-d_x^2+h_x(d_x-1/2)\\ &\le1/4+u(m-1/2). \end{aligned}

For dx≤1/2d_x\le1/2, the last product is nonpositive; otherwise use hx≤uh_x\le u and dx−1/2≤m−1/2d_x-1/2\le m-1/2. Integrating, and using q=a+∫U(gx+hx/2)q=a+\int_U(g_x+h_x/2), proves (2), since

u/4+u2(m−1/2)=1/8−(m−1/2)2(3/2−m).u/4+u^2(m-1/2) =1/8-(m-1/2)^2(3/2-m).

Unlike the maximum-degree-star special case, an arbitrary KK satisfying (1) need not have m≥2qm\ge2q. The further 2q22q^2 bound from that special case is not asserted here.

Without outside-degree domination, the same dual still gives the weaker estimate

Φ≥q−u(1+u2)4.(3)\Phi\ge q-\frac{u(1+u^2)}4. \tag{3}

Indeed

d−d2+h(d−1/2)=1+h24−(d−1+h2)2≤1+u24.d-d^2+h(d-1/2) =\frac{1+h^2}{4}-\left(d-\frac{1+h}{2}\right)^2 \le\frac{1+u^2}{4}.

Thus any joint clique with u(1+u2)≤1/2u(1+u^2)\le1/2 suffices for Φ≥q−1/8\Phi\ge q-1/8, without a condition on outside degrees. No universal existence assertion at this larger required mass is being made.

At least half the mass has degree greater than one half

Let H={x:Dx>1/2}H=\{x:D_x>1/2\}, and suppose h=w(H)≥1/2h=w(H)\ge1/2. Every two HH-types have intersecting neighborhoods, so A2A^2 is complete on HH. Every x∈Hx\in H has an HH-neighbor zz, because Dx>1/2≥1−hD_x>1/2\ge1-h. Append xzxz to a two-walk from zz to any y∈Hy\in H; this supplies a three-walk from xx to yy, including y=xy=x. Thus HH is a joint clique. Outside degrees are at most 1/2≤h1/2\le h, so (2) applies with K=HK=H.

This is a support-degree condition and permits arbitrary thinning. It is not a claim that super-Turan density forces h≥1/2h\ge1/2.

A maximum-mass joint clique need not work

Take types (p,J,I,C,L)(p,J,I,C,L), with weights

(29,30,30,1,10)/100.(29,30,30,1,10)/100.

Put loops at J,CJ,C, and edges

pJ, pI, pL, JC, IC.pJ,\ pI,\ pL,\ JC,\ IC.

Then Q=5081/20000>1/4Q=5081/20000>1/4. The triangular types are p,J,I,Cp,J,I,C; their joint two-/three-walk relation is complete except for pIpI. The unique maximum-mass joint clique is therefore

K={J,I,C},w(K)=61/100,K=\{J,I,C\},\qquad w(K)=61/100,

but its outside vertex pp has degree 7/107/10.

The different clique {p,J,C}\{p,J,C\}, of mass 3/53/5, does satisfy (1): its outside degrees are 3/103/10 and 29/10029/100. Thus this example refutes maximum-mass selection, not existence.

Even the stronger mass-only assertion “maximum joint-clique mass is at least maximum support degree” is false. In the five-type support with edges

U1U2, U1A, U2B, AB, AC, BCU_1U_2,\ U_1A,\ U_2B,\ AB,\ AC,\ BC

and a loop at CC, take weights (1/4,1/10,1/5,3/20,3/10)(1/4,1/10,1/5,3/20,3/10) in order U1,U2,A,B,CU_1,U_2,A,B,C. Its density is 27/10027/100. Only A,B,CA,B,C are triangular, and they form a joint clique of total mass 13/2013/20, whereas DA=7/10D_A=7/10. This clique nevertheless dominates outside degrees.

A degree-threshold majority construction is insufficient

For t>1/2t>1/2, put Ht={D>t}H_t=\{D>t\}, ht=w(Ht)h_t=w(H_t), and

Kt={v:Dv>1−t, dHt(v)>ht/2}.K_t=\{v:D_v>1-t,\ d_{H_t}(v)>h_t/2\}.

Each nonempty KtK_t is a joint clique. Two of its vertices have a common HtH_t-neighbor. If v∈Ktv\in K_t has neighbor z∈Htz\in H_t and y∈Kty\in K_t, then Dz+Dy>1D_z+D_y>1, supplying the remaining two-walk in v,z,…,yv,z,\ldots,y.

These cliques need not have half the mass. For the support

A=(0101011100011001001100011),w=(11,16,11,16,11)/65,A=\begin{pmatrix} 0&1&0&1&0\\ 1&1&1&0&0\\ 0&1&1&0&0\\ 1&0&0&1&1\\ 0&0&0&1&1 \end{pmatrix},\qquad w=(11,16,11,16,11)/65,

one has D=(32,38,27,38,27)/65D=(32,38,27,38,27)/65 and Q=1081/4225>1/4Q=1081/4225>1/4. For 1/2<t<38/651/2<t<38/65, Ht={1,3}H_t=\{1,3\}. The other four types have exactly half of its neighborhood mass; type 00 passes the degree condition only when t>33/65t>33/65. Thus KtK_t is empty for t≤33/65t\le33/65, is {0}\{0\} for 33/65<t<38/6533/65<t<38/65, and is empty for t≥38/65t\ge38/65. Its maximum mass is 11/6511/65. The support has a looped maximum-degree anchor, so an already proved cut theorem handles it.

Another explicit joint clique, with uncontrolled mass

Allow total vertex mass WW. If Q>W2/4Q>W^2/4, put

Δ=max⁡vdv,τ=W−Q/Δ.\Delta=\max_v d_v,\qquad \tau=W-Q/\Delta .

Then W/2≤τ<ΔW/2\le\tau<\Delta, and {v:dv>τ}\{v:d_v>\tau\} is a joint clique. The first inequality follows from 2Q≤WΔ2Q\le W\Delta; the second from Q>W2/4≥Δ(W−Δ)Q>W^2/4\ge\Delta(W-\Delta).

For proof of the clique claim, let t=dx≤r=dyt=d_x\le r=d_y exceed τ\tau. Their neighborhoods intersect since t+r>Wt+r>W. If they have no three-walk, those neighborhoods are anticomplete. Writing ii for their intersection mass, the four-set counting argument in the separation lemma gives

Q≤(r−i)2+(t−i)22+Δ(W−r−t+i).Q\le \frac{(r-i)^2+(t-i)^2}{2} +\Delta(W-r-t+i).

This is convex in ii, and r+t−W≤i≤tr+t-W\le i\le t. Therefore

Q≤max⁡{(W−t)2+(W−r)22,(r−t)22+Δ(W−r)}.Q\le\max\left\{ \frac{(W-t)^2+(W-r)^2}{2}, \frac{(r-t)^2}{2}+\Delta(W-r)\right\}.

The first term is less than (W−τ)2≤Δ(W−τ)=Q(W-\tau)^2\le\Delta(W-\tau)=Q. The second is at most Δ(W−t)<Δ(W−τ)=Q\Delta(W-t)<\Delta(W-\tau)=Q, since (r−t)2/2≤Δ(r−t)(r-t)^2/2\le\Delta(r-t). This contradiction also handles x=yx=y, proving the diagonal three-walk condition. No half-mass or outside-degree domination assertion for this set has been established.

The obstacle to extending the three-walk peeling proof

The box-pruning degree bound also works under a joint-clique cap: a fully triangular neighborhood is a two-walk clique through its anchor as well as a three-walk clique. Thus the same box optimum has

W−σ≤dv≤σW-\sigma\le d_v\le\sigma

and a maximum-degree anchor universal in the three-walk relation. It need not be universal in the two-walk relation.

An obstruction to that last shortcut is the triangular prism. For 0<t<10<t<1, give each top vertex weight (1+t)/6(1+t)/6 and each bottom vertex weight (1−t)/6(1-t)/6. Its only joins are the two triangles and their matching. Then

Δ=σ=12+t6,δ=1−σ,Q=14+t212>σ2+(1−σ)22.\Delta=\sigma=\frac12+\frac t6,\quad \delta=1-\sigma,\quad Q=\frac14+\frac{t^2}{12}> \frac{\sigma^2+(1-\sigma)^2}{2}.

Every maximum-degree top vertex lacks a two-walk to its matched bottom vertex. The three-walk relation is complete, and the joint relation is complete except for those three matched pairs. Its maximum joint-clique mass is 1/2+t/2>σ1/2+t/2>\sigma. Thus the example does not satisfy the putative joint-clique cap: it refutes using the degree window alone, not the desired theorem.

After selecting an anchor pp, forcing two-walk compatibility would require discarding Rp=V∖N2(p)R_p=V\setminus N^2(p). Such types have degree at most

W−Δ=(W−σ)+(σ−Δ).W-\Delta=(W-\sigma)+(\sigma-\Delta).

Their total mass need not be comparable to the selected atom's mass. The surplus loss from deleting them has not been charged; splitting the selected atom into tiny twins does not control this additional loss. This is the unresolved step in that adaptation.

Remaining question

Does every weighted support with Q>1/4Q>1/4 admit some KK satisfying (1)? An affirmative answer would finish the palette inequality by (2). The three-walk theorem alone, maximum-mass selection, and the threshold-majority construction do not establish this statement. No counterexample to this sufficient existence assertion is known in these notes.