MétaCan
Menu
Back to cohort
Record W1830735411 · doi:10.1002/jgt.21684

A Note on Hitting Maximum and Maximal Cliques With a Stable Set

2012· preprint· en· W1830735411 on OpenAlexafffund
Demetres Christofides, Katherine Edwards, Andrew D. King

Bibliographic record

VenueJournal of Graph Theory · 2012
Typepreprint
Languageen
FieldMathematics
TopicLimits and Structures in Graph Theory
Canadian institutionsSimon Fraser University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCombinatoricsOmegaCounterexampleConjectureMathematicsGraphCliqueClique graphSplit graphIndependent setDiscrete mathematicsSet (abstract data type)Chordal graphLine graphPhysicsComputer science1-planar graphGraph power

Abstract

fetched live from OpenAlex

Abstract It was recently proved that any graph satisfying contains a stable set hitting every maximum clique. In this note, we prove that the same is true for graphs satisfying unless the graph is the strong product of an odd hole and .We also provide a counterexample to a recent conjecture on the existence of a stable set hitting every sufficiently large maximal clique.

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.005
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: Methods · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0020.003
Scholarly communication0.0020.003
Open science0.0010.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0060.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.032
GPT teacher head0.304
Teacher spread0.271 · 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
GenreMethods

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
Published2012
Admission routes2
Has abstractyes

Explore more

Same venueJournal of Graph TheorySame topicLimits and Structures in Graph TheoryFrench-language works237,207