{"id":"W4289222390","doi":"10.1016/j.jctb.2022.06.002","title":"Bounding χ by a fraction of Δ for graphs without large cliques","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Degree (music); Upper and lower bounds; Conjecture; Discrete mathematics; Vertex (graph theory); Brooks' theorem; Bounding overwatch; Fractional coloring; Graph; Clique; Chromatic scale; Graph coloring; Greedy coloring; Clique number; Chordal graph; Graph power; Line graph; 1-planar graph; Computer science","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005871461,0.003061925,0.002412286,0.002603387,0.002232115,0.004148461,0.006184922,0.003061989,0.00744134],"category_scores_gemma":[0.05201118,0.001493095,0.001868147,0.001999742,0.004159642,0.01469578,0.004688318,0.005525902,0.001806396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003696982,"about_ca_system_score_gemma":0.002075266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002642201,"about_ca_topic_score_gemma":0.003045335,"domain_scores_codex":[0.9944916,0.001596116,0.000182099,0.001543999,0.0009439746,0.001242322],"domain_scores_gemma":[0.9230933,0.06215424,0.002465436,0.008212443,0.001355901,0.002718677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003139345,0.0008162836,0.01358066,0.001546215,0.000416376,0.0005534039,0.0007478348,0.4208038,0.03122489,0.4066506,0.02626327,0.09425728],"study_design_scores_gemma":[0.00006383265,0.0001059932,0.001291459,0.0001171784,0.0001114526,0.000266078,0.000112633,0.6682464,0.008587579,0.3175993,0.0034482,0.00004990787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3150925,0.005369253,0.6092999,0.01244544,0.0009189735,0.0002194312,0.001842286,0.005621656,0.04919043],"genre_scores_gemma":[0.8791239,0.001415163,0.1066045,0.001692411,0.0007004832,0.0002135964,0.0008637197,0.001497136,0.007889092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00744134,"threshold_uncertainty_score":0.03105164,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01265890916885139,"score_gpt":0.3040081224991669,"score_spread":0.2913492133303155,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}