MétaCan
Menu
Back to cohort
Record W3023596029 · doi:10.1002/jgt.22607

Short rainbow cycles in graphs and matroids

2020· preprint· en· W3023596029 on OpenAlexafffund
Matt DeVos, Matthew Drescher, Daryl Funk, Sebastián González Hermosillo de la Maza, Krystal Guo, Tony Huynh, Bojan Mohar, Amanda Montejano

Bibliographic record

VenueJournal of Graph Theory · 2020
Typepreprint
Languageen
FieldMathematics
TopicLimits and Structures in Graph Theory
Canadian institutionsDouglas CollegeSimon Fraser University
FundersH2020 European Research CouncilNatural Sciences and Engineering Research Council of CanadaJavna Agencija za Raziskovalno Dejavnost RS
KeywordsMatroidCombinatoricsRainbowConjectureMathematicsGeneralizationVertex (graph theory)Binary numberGraphGraphic matroidSimple (philosophy)Discrete mathematicsPhysicsArithmeticPhilosophy

Abstract

fetched live from OpenAlex

Abstract Let be a simple ‐vertex graph and be a coloring of with colors, where each color class has size at least 2. We prove that contains a rainbow cycle of length at most , which is best possible. Our result settles a special case of a strengthening of the Caccetta‐Häggkvist conjecture, due to Aharoni. We also show that the matroid generalization of our main result also holds for cographic matroids, but fails for binary matroids.

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.

How this classification was reachedexpand

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.003
metaresearch head score (Gemma)0.001
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: Empirical
Teacher disagreement score0.006
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.002
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.043
GPT teacher head0.317
Teacher spread0.274 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2020
Admission routes2
Has abstractyes

Explore more

Same venueJournal of Graph TheorySame topicLimits and Structures in Graph TheoryFrench-language works237,207