{"id":"W4235275672","doi":"10.1002/jgt.20064","title":"The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Conjecture; Foster graph; Discrete mathematics; Critical graph; Edge coloring; Friendship graph; Random graph; Graph; Windmill graph; Brooks' theorem; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Graph power; Line 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333758,0.0003487379,0.0004578402,0.001944593,0.001254308,0.001865883,0.001421582,0.0006775018,0.003760644],"category_scores_gemma":[0.01098552,0.0004213499,0.0003320055,0.001082928,0.003145051,0.002217486,0.001063766,0.001139949,0.0003498433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002524239,"about_ca_system_score_gemma":0.0007935506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002221312,"about_ca_topic_score_gemma":0.002021704,"domain_scores_codex":[0.9992267,0.0001697436,0.00003066845,0.0003075839,0.000133564,0.0001318472],"domain_scores_gemma":[0.9890668,0.006141992,0.001509302,0.001611961,0.0008177773,0.0008520703],"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.0005434901,0.0001218688,0.03389077,0.0003244015,0.0001115992,0.0002625932,0.0005497518,0.06162089,0.02901952,0.8279403,0.005851568,0.03976317],"study_design_scores_gemma":[0.0001030456,0.0001745003,0.02056344,0.0001047634,0.0001050577,0.001272977,0.0003570135,0.2137208,0.0229341,0.7295286,0.0109795,0.0001561103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8772391,0.0006375115,0.09782911,0.001434433,0.00007515647,0.00006133279,0.0005426692,0.0004085234,0.02177215],"genre_scores_gemma":[0.9897038,0.0003222941,0.007102263,0.0001740005,0.00004464706,0.00007754506,0.0002213213,0.00006325627,0.002290825],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003760644,"threshold_uncertainty_score":0.01831472,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01308008132324962,"score_gpt":0.2844518910577733,"score_spread":0.2713718097345237,"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."}}