{"id":"W4303438707","doi":"10.1002/jgt.22897","title":"Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic 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":"Fondo Nacional de Desarrollo Científico, Tecnológico y de Innovación Tecnológica; Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Degree (music); Minimum degree spanning tree; Graph; Discrete mathematics; Spanning tree","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.001528542,0.0004330699,0.0009478728,0.001340661,0.001146902,0.001781164,0.001482101,0.0009838528,0.003905287],"category_scores_gemma":[0.01804243,0.0004403894,0.0005415146,0.001133662,0.002158114,0.005133556,0.00211689,0.001753154,0.0003639339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001057711,"about_ca_system_score_gemma":0.0003994672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007816294,"about_ca_topic_score_gemma":0.0009224249,"domain_scores_codex":[0.9993703,0.0001357457,0.00002586971,0.0001861004,0.0001430072,0.0001390983],"domain_scores_gemma":[0.9874692,0.00883935,0.0008696663,0.001080126,0.0007721215,0.0009696176],"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.0004324379,0.0002020383,0.01809051,0.0006586004,0.0001376639,0.001073242,0.001368119,0.06437512,0.02487386,0.8396676,0.0104293,0.03869158],"study_design_scores_gemma":[0.00004273447,0.000112349,0.005799565,0.0001174633,0.0001159146,0.001584635,0.0005620341,0.2419919,0.007826678,0.7370671,0.004739929,0.00003962044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7588966,0.002594654,0.1990854,0.00260618,0.0001307503,0.00003653811,0.0003467522,0.0009976709,0.03530537],"genre_scores_gemma":[0.9871296,0.0005229457,0.01057061,0.0002360715,0.0001245829,0.00002676915,0.0001285384,0.00008961691,0.001171218],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003905287,"threshold_uncertainty_score":0.0130645,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02759842679262543,"score_gpt":0.2614477421452291,"score_spread":0.2338493153526037,"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."}}