{"id":"W2016667694","doi":"10.1007/s004930200014","title":"Ramsey Numbers for Trees of Small Maximum Degree","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Degree (music); Ramsey's theorem; Vertex (graph theory); Graph; Upper and lower bounds; Complete bipartite graph; Tree (set theory); Discrete mathematics","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.0001720393,0.0001430916,0.000287122,0.00006435813,0.0001292152,0.00001048667,0.0003207616,0.0001069897,0.0001662117],"category_scores_gemma":[0.0003157654,0.0001190922,0.000173886,0.0001509264,0.0000864227,0.0000345441,0.00007524635,0.00009698957,0.000004804017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002671798,"about_ca_system_score_gemma":0.000005838073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004778609,"about_ca_topic_score_gemma":0.000003301466,"domain_scores_codex":[0.9991455,0.00003938279,0.0002721792,0.000173825,0.0001373864,0.0002317478],"domain_scores_gemma":[0.9987569,0.000518799,0.0001419638,0.0004242772,0.00009128861,0.00006675832],"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.00002047843,0.0001793341,0.0006299871,0.0001223134,0.00006093771,0.000002234514,0.0008000024,4.922574e-7,0.00006160714,0.9716125,0.01687888,0.009631295],"study_design_scores_gemma":[0.0008500489,0.0001387666,0.0003094639,0.00002011666,0.00004829198,0.000004495923,0.00006861295,0.0001524448,0.0007192428,0.9865959,0.01094077,0.0001518562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8094656,0.001678931,0.007803276,0.0004758153,0.002907446,0.001367612,0.00005684987,0.0003411024,0.1759034],"genre_scores_gemma":[0.9899778,0.00003211726,0.008161109,0.00004676082,0.00004242707,0.00002685447,0.000001479474,0.00003108486,0.00168037],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1805122,"threshold_uncertainty_score":0.4856439,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1102685928597671,"score_gpt":0.2864809694619955,"score_spread":0.1762123766022284,"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."}}