MétaCan
Menu
Back to cohort
Record W3107865975 · doi:10.1002/jgt.22904

A density bound for triangle‐free 4‐critical graphs

2022· article· en· W3107865975 on OpenAlexafffund
Benjamin Moore, Evelyne Smith‐Roberge

Bibliographic record

VenueJournal of Graph Theory · 2022
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Theory Research
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsKlein bottleMathematicsCombinatoricsPlanar graphVertex (graph theory)Disjoint setsTorusChordal graphProjective planeDiscrete mathematicsGraph

Abstract

fetched live from OpenAlex

Abstract We prove that every triangle‐free 4‐critical graph satisfies . This result gives a unified proof that triangle‐free planar graphs are 3‐colourable, as well as that graphs of girth at least five which embed in either the projective plane, torus or Klein Bottle are 3‐colourable, which are results of Grötzsch, Thomassen, and Thomas and Walls. Our result is nearly the best possible, as Davies has constructed triangle‐free 4‐critical graphs such that . To prove this result, we prove a more general result characterizing sparse 4‐critical graphs with few vertex‐disjoint triangles.

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.007
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
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.877
Threshold uncertainty score0.622

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0070.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0030.001
Research integrity0.0000.001
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.027
GPT teacher head0.314
Teacher spread0.287 · 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.

The models applied no category: nothing in the taxonomy fit this work.
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
Published2022
Admission routes2
Has abstractyes

Explore more

Same venueJournal of Graph TheorySame topicAdvanced Graph Theory ResearchFrench-language works237,207