MétaCan
Menu
Back to cohort
Record W1896292437 · doi:10.1002/jgt.21838

On Sheehan's Conjecture for Graphs with Symmetry

2014· article· en· W1896292437 on OpenAlexafffund
Mateja Šajna, Andrew Wagner

Bibliographic record

VenueJournal of Graph Theory · 2014
Typearticle
Languageen
FieldMathematics
TopicFinite Group Theory Research
Canadian institutionsUniversity of Ottawa
FundersNatural Sciences and Engineering Research Council of CanadaCanadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
KeywordsMathematicsConjectureCombinatoricsAutomorphismGraphGraph automorphismHamiltonian pathPetersen graphAutomorphism groupHamiltonian (control theory)Discrete mathematicsVoltage graphLine graph

Abstract

fetched live from OpenAlex

Abstract Sheehan's Conjecture states that every hamiltonian 4‐regular graph possesses a second Hamilton cycle. In this article, we verify Sheehan's Conjecture for 4‐regular graphs of order n whose automorphism group has size at least if either for all , or for and m is either an odd prime or a power of 2. We also give lower bounds on the size of the automorphism group and degree of a regular hamiltonian graph that guarantee existence of a second Hamilton 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 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.005
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: Empirical
Teacher disagreement score0.084
Threshold uncertainty score0.530

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0050.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
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.310
Teacher spread0.282 · 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

Citations2
Published2014
Admission routes2
Has abstractyes

Explore more

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