MétaCan
Menu
Back to cohort
Record W2071386577 · doi:10.1017/s0963548313000540

Conflict-Free Colouring of Graphs

2013· article· en· W2071386577 on OpenAlexfundno aff
Roman Glebov, Tibor Szabó, Gábor Tardos

Bibliographic record

VenueCombinatorics Probability Computing · 2013
Typearticle
Languageen
FieldMathematics
TopicLimits and Structures in Graph Theory
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaFreie Universität BerlinHungarian Scientific Research FundDeutsche Forschungsgemeinschaft
KeywordsChromatic scaleCritical graphCombinatoricsMathematicsVertex (graph theory)Random graphGraphProbabilistic logicDiscrete mathematicsLine graphVoltage graphStatistics

Abstract

fetched live from OpenAlex

We study the conflict-free chromatic number χCFof graphs from extremal and probabilistic points of view. We resolve a question of Pach and Tardos about the maximum conflict-free chromatic number ann-vertex graph can have. Our construction is randomized. In relation to this we study the evolution of the conflict-free chromatic number of the Erdős–Rényi random graphG(n,p) and give the asymptotics forp= ω(1/n). We also show that forp≥ 1/2 the conflict-free chromatic number differs from the domination number by at most 3.

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.014
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: Empirical
Teacher disagreement score0.003
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.014
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0020.001
Science and technology studies0.0020.003
Scholarly communication0.0020.004
Open science0.0020.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.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.041
GPT teacher head0.277
Teacher spread0.236 · 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

Citations29
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueCombinatorics Probability ComputingSame topicLimits and Structures in Graph TheoryFrench-language works237,207