{"id":"W2170800107","doi":"10.1016/s0012-365x(01)00046-2","title":"Star forests, dominating sets and Ramsey-type problems","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina; University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Star (game theory); Graph; Upper and lower bounds; Complete bipartite graph; Discrete mathematics; Minimum degree spanning tree; Edge-transitive graph; Graph power; Line graph","routes":{"ca_aff":true,"ca_fund":false,"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.001841723,0.0007196845,0.001357373,0.001241146,0.002300573,0.003794285,0.001549381,0.002148719,0.004505903],"category_scores_gemma":[0.005206747,0.0008471301,0.0007951167,0.003116729,0.00279206,0.008778959,0.001672511,0.003235634,0.0004569146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001470458,"about_ca_system_score_gemma":0.0008544332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009611652,"about_ca_topic_score_gemma":0.001698672,"domain_scores_codex":[0.9990552,0.0003769492,0.00004158581,0.0002277047,0.0001809585,0.0001177051],"domain_scores_gemma":[0.9958581,0.002999539,0.0003751954,0.0002472716,0.0001827653,0.0003371353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001835728,0.0001272409,0.0008947524,0.0003054673,0.00004823558,0.0001082533,0.0003912263,0.01135301,0.001136702,0.9559622,0.008784812,0.02070441],"study_design_scores_gemma":[0.00002409105,0.00001431746,0.0002505108,0.00001530354,0.00001860122,0.0001203819,0.0001235866,0.009473087,0.0001860481,0.987045,0.002720955,0.000008147407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4899637,0.02692963,0.3488321,0.01895527,0.001068367,0.0001661763,0.001351263,0.0004141988,0.1123193],"genre_scores_gemma":[0.8987491,0.01076971,0.05776497,0.001511568,0.001491752,0.000189591,0.001013752,0.00008357806,0.02842598],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004505903,"threshold_uncertainty_score":0.01507372,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03875877468305888,"score_gpt":0.2928616208084517,"score_spread":0.2541028461253929,"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."}}