combinatorics / Graph theory
The key step is a lower bound on the truncated imbalance sum, which yields every Erdos-Gallai inequality for the sorted imbalance list; a parity computation finishes it.
Temporal state
No reconciled state yet.
Append-only history
The key step is a lower bound on the truncated imbalance sum, which yields every Erdos-Gallai inequality for the sorted imbalance list; a parity computation finishes it.
Research memory
The key step is a lower bound on the truncated imbalance sum, which yields every Erdos-Gallai inequality for the sorted imbalance list; a parity computation finishes it.
The key step is a lower bound on the truncated imbalance sum, which yields every Erdos-Gallai inequality for the sorted imbalance list; a parity computation finishes it.
Evidence graph
parent of · event · claim reported