{"id":"W12746167","doi":"10.1080/08880010390203125","title":"Vertex-Disjoint K1, t's in Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008060472,0.0007399081,0.0008180813,0.002150076,0.002353779,0.002120617,0.001034418,0.001517957,0.00773839],"category_scores_gemma":[0.005303439,0.0005015045,0.0009442681,0.002312027,0.001629094,0.003632197,0.001883416,0.001331644,0.001354007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001525356,"about_ca_system_score_gemma":0.0007423363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001799427,"about_ca_topic_score_gemma":0.003404107,"domain_scores_codex":[0.9990597,0.0002553225,0.00008225888,0.0002680612,0.0001628367,0.0001717838],"domain_scores_gemma":[0.9959915,0.001970665,0.0008922293,0.0003721594,0.000264429,0.0005090156],"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.0006393052,0.000176687,0.004238179,0.001020084,0.0002215944,0.002273981,0.001333324,0.02689717,0.006595127,0.8749829,0.02247242,0.05914927],"study_design_scores_gemma":[0.0000740349,0.00008043291,0.001738712,0.00009018115,0.00007455504,0.001705748,0.0003991799,0.02360696,0.001409479,0.9466782,0.02411617,0.00002636769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6156946,0.007745532,0.2733652,0.005720849,0.00119414,0.0004901124,0.006104113,0.001248504,0.08843689],"genre_scores_gemma":[0.8960193,0.003329783,0.06726746,0.0008301337,0.0002961634,0.0002407045,0.004266223,0.0002605408,0.02748968],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00773839,"threshold_uncertainty_score":0.02588749,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02189810304786427,"score_gpt":0.2613190684931314,"score_spread":0.2394209654452671,"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."}}