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 color bound open.
need not contain half the vertices of a super-Turan graph.
A finite simple-graph construction
For an integer , use vertices:
- a clique of order , partitioned into three sets of size ;
- an independent set , partitioned into three sets of size ;
- a complete six-partite graph , with parts of size .
Add all - edges and all - edges, and no others. The vertex degrees are
Thus exactly the edges inside have endpoint-degree sum greater than : their sum is , whereas the sums on are respectively . Consequently
Nevertheless
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 of weight , three independent of weight , and six independent -parts of weight , joined as above. Its parameters are
This refutes both the weak conjecture and the stronger attempted analogue of the triangle-vertex mass theorem.
It does not obstruct the unrestricted three-walk clique: every type pair has a two-walk. For , use ; for , use ; for and , use respectively and ; for , use a different -part. The - case is immediate. There are no isolated types, so all pairs also have three-walks. Every type is triangular. Therefore is complete and its palette cost is , well above the desired .
The proved fact that is a three-walk clique remains valid. Its mass, however, cannot serve as a universal half-vertex certificate.