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 satisfies
where is the support degree. Diagonal conditions are included. Then, for arbitrary supported demands , of density ,
In particular implies .
Put , , , and, for ,
The internal -types form a conflict clique. They also conflict with every cut type: for internal and cut , use two-walks from and to , appending to the latter. All cut types are active because their -endpoint is triangular.
In any compatible cut palette, the outside neighborhoods are pairwise disjoint. An intersection would supply a two-walk between the outside endpoints, while the -endpoints have a three-walk. Hence the dual assigning value one to internal types, value to a cut type , and zero elsewhere is feasible:
Now and , so
For , the last product is nonpositive; otherwise use and . Integrating, and using , proves (2), since
Unlike the maximum-degree-star special case, an arbitrary satisfying (1) need not have . The further bound from that special case is not asserted here.
Without outside-degree domination, the same dual still gives the weaker estimate
Indeed
Thus any joint clique with suffices for , 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 , and suppose . Every two -types have intersecting neighborhoods, so is complete on . Every has an -neighbor , because . Append to a two-walk from to any ; this supplies a three-walk from to , including . Thus is a joint clique. Outside degrees are at most , so (2) applies with .
This is a support-degree condition and permits arbitrary thinning. It is not a claim that super-Turan density forces .
A maximum-mass joint clique need not work
Take types , with weights
Put loops at , and edges
Then . The triangular types are ; their joint two-/three-walk relation is complete except for . The unique maximum-mass joint clique is therefore
but its outside vertex has degree .
The different clique , of mass , does satisfy (1): its outside degrees are and . 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
and a loop at , take weights in order . Its density is . Only are triangular, and they form a joint clique of total mass , whereas . This clique nevertheless dominates outside degrees.
A degree-threshold majority construction is insufficient
For , put , , and
Each nonempty is a joint clique. Two of its vertices have a common -neighbor. If has neighbor and , then , supplying the remaining two-walk in .
These cliques need not have half the mass. For the support
one has and . For , . The other four types have exactly half of its neighborhood mass; type passes the degree condition only when . Thus is empty for , is for , and is empty for . Its maximum mass is . 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 . If , put
Then , and is a joint clique. The first inequality follows from ; the second from .
For proof of the clique claim, let exceed . Their neighborhoods intersect since . If they have no three-walk, those neighborhoods are anticomplete. Writing for their intersection mass, the four-set counting argument in the separation lemma gives
This is convex in , and . Therefore
The first term is less than . The second is at most , since . This contradiction also handles , 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
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 , give each top vertex weight and each bottom vertex weight . Its only joins are the two triangles and their matching. Then
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 . 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 , forcing two-walk compatibility would require discarding . Such types have degree at most
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 admit some 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.