{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004413532,0.000160522,0.0001983883,0.00009920621,0.0001683448,0.0001983932,0.0006047394,0.00004980583,0.00004356616],"category_scores_gemma":[0.0002336418,0.0001314605,0.00003918591,0.0004060458,0.0001188391,0.0004361444,0.0004014216,0.000171629,0.00007924229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002071126,"about_ca_system_score_gemma":0.000008144867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001562407,"about_ca_topic_score_gemma":0.00000500035,"domain_scores_codex":[0.9986446,0.00005197676,0.0002593546,0.0003016232,0.0003561886,0.0003862146],"domain_scores_gemma":[0.9988354,0.0002628879,0.0001055515,0.0005860012,0.00008455302,0.0001255772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005752881,0.0001782579,0.0007579876,0.0007401032,0.00005712532,0.00005099893,0.01605026,0.0001750792,0.001520864,0.9374907,0.0007620832,0.0422108],"study_design_scores_gemma":[0.0003314587,0.0001245895,0.0001244434,0.0001083398,0.000006001426,0.00004555821,0.0001973647,0.5919352,0.0004972196,0.4057379,0.0006452287,0.0002467225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2776404,0.001442736,0.7066926,0.001059983,0.0001823427,0.001057667,0.00000928297,0.0004556742,0.01145935],"genre_scores_gemma":[0.6617229,0.00008619101,0.3371399,0.00005263488,0.00002215303,0.00002432207,0.000002067046,0.00003007733,0.0009197322],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5917601,"threshold_uncertainty_score":0.5360804,"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."}}