{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002759179,0.0009818634,0.002365886,0.002454745,0.004154699,0.006321055,0.003988526,0.003813635,0.01383379],"category_scores_gemma":[0.03507346,0.001901909,0.001589446,0.004188438,0.004333178,0.01316768,0.004702582,0.005528253,0.001415102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004269178,"about_ca_system_score_gemma":0.002462605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002766259,"about_ca_topic_score_gemma":0.00527876,"domain_scores_codex":[0.9964511,0.0009090938,0.0001722408,0.0006250149,0.001086991,0.0007554492],"domain_scores_gemma":[0.9731876,0.01903062,0.001932936,0.002313315,0.001450889,0.002084811],"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.001497547,0.0003264468,0.004397152,0.0007044013,0.0001672757,0.0005105952,0.001025619,0.03262501,0.003938405,0.9003973,0.02346895,0.03094138],"study_design_scores_gemma":[0.0001933366,0.00003984746,0.0008434303,0.00004055765,0.00006635118,0.0002557011,0.0002538066,0.04991817,0.0008329497,0.9450141,0.002515463,0.0000262001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8121057,0.002877464,0.09473807,0.01611121,0.0006293025,0.0002136151,0.002660957,0.001410167,0.06925362],"genre_scores_gemma":[0.960635,0.001145905,0.01958174,0.001198497,0.0005174105,0.0002025639,0.001240658,0.0002912614,0.01518702],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01383379,"threshold_uncertainty_score":0.04627866,"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."}}