Bibliographic record
Abstract
Abstract A quasi‐line graph is a graph in which the neighborhood of any vertex can be covered by two cliques; every line graph is a quasi‐line graph. Reed conjectured that for any graph G, $\chi({{G}}) \leq\left \lceil {{{1}}\over {{2}}}(\Delta({{G}})+{{1}}+\omega({{G}}))\right\rceil$ [Reed, J Graph Theory 27 (1998), 177–212]. We prove that the conjecture holds if G is a quasi‐line graph, extending a result of King et al. who proved the conjecture for line graphs [Eur J Comb 28 (2007), 2182–2187], and improving the bound of $\chi{{(}}{{G}}{{)}} \leq {3\over 2} \omega({{G}})$ given by Chudnovsky and Ovetsky [J Graph Theory 54 (2007), 41–50]. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 215–228, 2008
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.030 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.008 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".