{"id":"W2103626912","doi":"10.37236/278","title":"Large Bounded Degree Trees in Expanding Graphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"University of Illinois at Urbana-Champaign; Hungarian Scientific Research Fund; National Science Foundation","keywords":"Mathematics; Bounded function; Combinatorics; Degree (music); Embedding; Dense graph; Random graph; Discrete mathematics; Graph; Spanning tree; Spectral gap; 1-planar graph; Chordal graph; Computer science","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.002697169,0.0001675557,0.0003295135,0.0002299572,0.0002659714,0.00004149857,0.0007215695,0.0001191583,0.00003698967],"category_scores_gemma":[0.0004678644,0.0001029308,0.0001899884,0.0004219332,0.00009280108,0.0001422839,0.00008341784,0.001796051,9.505081e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001073092,"about_ca_system_score_gemma":0.0001765101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002578086,"about_ca_topic_score_gemma":0.0001534778,"domain_scores_codex":[0.9982143,0.0001520696,0.0005079175,0.00009788157,0.0003935763,0.0006342765],"domain_scores_gemma":[0.9984417,0.0006096122,0.0004134085,0.0003492229,0.0001213065,0.00006474091],"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.00005460346,0.0001198834,0.001612208,0.000007139456,0.00005874528,0.0000108023,0.001269707,6.61981e-7,0.0007272427,0.9957668,0.000164638,0.000207546],"study_design_scores_gemma":[0.00125639,0.0001903555,0.001249818,0.00002105971,0.00004701947,0.0002090237,0.0003624842,0.00001477222,0.001137078,0.9940065,0.00138177,0.0001237024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9948581,0.0008170702,0.001056887,0.0002059947,0.001097099,0.0001039508,7.285439e-7,0.00001552205,0.001844617],"genre_scores_gemma":[0.9993958,0.0002386421,0.00005501141,0.00004671391,0.0001039972,0.000002029495,2.090396e-7,0.00002550012,0.000132086],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00453768,"threshold_uncertainty_score":0.7803047,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01994977074148044,"score_gpt":0.2944839138187778,"score_spread":0.2745341430772973,"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."}}