MétaCan
Menu
Back to cohort
Record W4297907868 · doi:10.48550/arxiv.1305.1451

Explicit bounds for graph minors

2013· preprint· en· W4297907868 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenuearXiv (Cornell University) · 2013
Typepreprint
Languageen
FieldComputer Science
TopicComplexity and Algorithms in Graphs
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaNederlandse Organisatie voor Wetenschappelijk Onderzoek
KeywordsCombinatoricsSigmaMathematicsDisjoint setsVertex (graph theory)GraphHomeomorphism (graph theory)Discrete mathematicsPath (computing)PhysicsComputer scienceQuantum mechanics

Abstract

fetched live from OpenAlex

Let $Σ$ be a surface with boundary $b(Σ)$, $\mathcal{L}$ be a collection of $k$ disjoint $b(Σ)$-paths in $Σ$, and $P$ be a non-separating $b(Σ)$-path in $Σ$. We prove that there is a homeomorphism $ϕ: Σ\to Σ$ that fixes each point of $b(Σ)$ and such that $ϕ(\mathcal{L})$ meets $P$ at most $2k$ times. With this theorem, we derive explicit constants in the graph minor algorithms of Robertson and Seymour. We reprove a result concerning redundant vertices for graphs on surfaces, but with explicit bounds. That is, we prove that there exists a computable integer $t:=t(Σ,k)$ such that if $v$ is a '$t$-protected' vertex in a surface $Σ$, then $v$ is redundant with respect to any $k$-linkage.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.858
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0030.002
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.105
GPT teacher head0.194
Teacher spread0.088 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it