Add connected tire clusters with two-cluster-per-vertex proposition

Browse Source

Define a connected tire cluster (union of same-depth tires joined by
shared vertices, transitive closure), prove same-depth tires meet only
in vertices, and prove every vertex lies in at most two clusters (one at
each of two consecutive depths) -- the bounded coarsening of the
unbounded per-vertex tire count.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>

...

This commit is contained in:

didericis

2026-06-17 01:03:37 -04:00

parent 251c453437

commit 646cf9d12f

4 changed files with 154 additions and 40 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download Patch File Download Diff File Expand all files Collapse all files

papers/heawood_restrictions_on_nested_tire_graph_duals/paper.pdf

BIN

Binary file not shown.