MétaCan
Menu
Back to cohort
Record W2950318982 · doi:10.37236/1020

On Directed Triangles in Digraphs

2007· article· en· W2950318982 on OpenAlexaff
Peter Hamburger, Penny Haxell, Alexandr Kostochka

Bibliographic record

VenueThe Electronic Journal of Combinatorics · 2007
Typearticle
Languageen
FieldMathematics
TopicLimits and Structures in Graph Theory
Canadian institutionsUniversity of Waterloo
FundersPurdue UniversityAmerican Institute of MathematicsNational Science Foundation
KeywordsCombinatoricsDigraphMathematicsConjectureVertex (graph theory)Directed graphDiscrete mathematicsGraph

Abstract

fetched live from OpenAlex

Using a recent result of Chudnovsky, Seymour, and Sullivan, we slightly improve two bounds related to the Caccetta-Haggkvist Conjecture. Namely, we show that if $\alpha\geq 0.35312$, then each $n$-vertex digraph $D$ with minimum outdegree at least $\alpha n$ has a directed $3$-cycle. If $\beta\geq 0.34564$, then every $n$-vertex digraph $D$ in which the outdegree and the indegree of each vertex is at least $\beta n$ has a directed $3$-cycle.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.012
Version: metacan-v3-hybrid-931329e0061cValidation 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.014
Threshold uncertainty score0.046

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.012
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.003
Science and technology studies0.0020.002
Scholarly communication0.0020.006
Open science0.0020.004
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0140.002

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.013
GPT teacher head0.288
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 source (direct Gemma or distilled Codex), 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

Citations25
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueThe Electronic Journal of CombinatoricsSame topicLimits and Structures in Graph TheoryFrench-language works237,207