{"id":"W4300427120","doi":"10.1002/jgt.22899","title":"Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Conjecture; Degree (music); Vertex connectivity; Minimum degree spanning tree; Graph; Discrete mathematics","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.001784238,0.0006382312,0.001737498,0.001805415,0.001883598,0.002918482,0.001489607,0.00116337,0.004756251],"category_scores_gemma":[0.01255362,0.0009290844,0.0007533212,0.00192278,0.002350565,0.006533292,0.003340458,0.001850112,0.0005007185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001073667,"about_ca_system_score_gemma":0.0004173353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001123766,"about_ca_topic_score_gemma":0.00109173,"domain_scores_codex":[0.9988139,0.0001974745,0.00006003736,0.0004100474,0.0002102496,0.0003083445],"domain_scores_gemma":[0.9904265,0.006074713,0.0008799617,0.0008996048,0.0006268815,0.001092482],"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.0005114675,0.0002129978,0.01103994,0.000671505,0.0001592838,0.001146383,0.002222871,0.0389403,0.02339871,0.8861848,0.006392848,0.0291189],"study_design_scores_gemma":[0.00006458046,0.0001487264,0.003644955,0.0001160711,0.0001547605,0.001407712,0.0007986294,0.08778218,0.007490654,0.8916194,0.006724316,0.00004799981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7657896,0.002414728,0.2002029,0.001723755,0.0001138536,0.00004970643,0.0004351865,0.0006913843,0.02857891],"genre_scores_gemma":[0.9839684,0.0005407285,0.01352836,0.0002364533,0.0001033234,0.00003294403,0.0001571978,0.00007959182,0.001353014],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004756251,"threshold_uncertainty_score":0.01591122,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02316656221824536,"score_gpt":0.2490706252883467,"score_spread":0.2259040630701014,"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."}}