MétaCan
Menu
Back to cohort
Record W3181935061 · doi:10.1002/jgt.22956

Adaptable and conflict colouring multigraphs with no cycles of length three or four

2023· article· en· W3181935061 on OpenAlexafffund
Jurgen Aliaj, Michael Molloy

Bibliographic record

VenueJournal of Graph Theory · 2023
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Theory Research
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMultigraphCombinatoricsInteger (computer science)MathematicsEnhanced Data Rates for GSM EvolutionDiscrete mathematicsComputer scienceGraphArtificial intelligence

Abstract

fetched live from OpenAlex

Abstract The adaptable choosability of a multigraph , denoted , is the smallest integer such that any edge labelling, , of and any assignment of lists of size to the vertices of permits a list colouring, , of such that there is no edge where . Here we show that for a multigraph with maximum degree and no cycles of length 3 or 4, . Under natural restrictions we can show that the same bound holds for the conflict choosability of , which is a closely related parameter recently defined by Dvořák, Esperet, Kang and Ozeki.

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.000
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.081
Threshold uncertainty score0.477

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
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.048
GPT teacher head0.292
Teacher spread0.244 · 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

Citations1
Published2023
Admission routes2
Has abstractyes

Explore more

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