{"id":"W1982321501","doi":"10.1016/j.aim.2011.03.015","title":"Exponentially many perfect matchings in cubic graphs","year":2011,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Seventh Framework Programme; Agentúra na Podporu Výskumu a Vývoja; National Science Foundation","keywords":"Lemma (botany); Mathematics; Conjecture; Cubic graph; Exposition (narrative); Combinatorics; Graph; Exponential growth; Discrete mathematics; Line graph; Mathematical analysis; Voltage graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009370751,0.0002142493,0.0003124835,0.0005145145,0.00006055354,0.00004796449,0.001557163,0.00006511409,0.00006325028],"category_scores_gemma":[0.0001419725,0.0001983398,0.0000777315,0.001044291,0.0001407806,0.001631775,0.0003798794,0.0003436983,0.0000950394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005440865,"about_ca_system_score_gemma":0.00003056299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001094986,"about_ca_topic_score_gemma":0.00006071262,"domain_scores_codex":[0.9979905,0.000114615,0.0004989916,0.0004398215,0.0004014867,0.0005545788],"domain_scores_gemma":[0.9986293,0.0002864879,0.0001406122,0.0008198664,0.00004311498,0.00008066699],"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.00001394801,0.0003179541,0.002889482,0.0001508367,0.000005319992,0.0001127321,0.007687681,0.0001207861,0.0006747066,0.9717311,0.000004893177,0.01629054],"study_design_scores_gemma":[0.0003631297,0.00006387734,0.001309856,0.000144398,0.000001764728,0.00002521024,0.0003079654,0.008153833,0.002138161,0.9870826,0.0001654862,0.0002437334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2556336,0.001814801,0.7158173,0.00005972222,0.0003304925,0.0005840883,0.000001684417,0.0002173068,0.02554097],"genre_scores_gemma":[0.6174402,0.0005954612,0.3816428,0.00004701935,0.000009760608,0.00007194465,6.023894e-7,0.00002446085,0.0001677804],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3618066,"threshold_uncertainty_score":0.8088063,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0268810690796377,"score_gpt":0.2954438687718008,"score_spread":0.2685627996921631,"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."}}