{"id":"W2794133300","doi":"","title":"Bipartite graphs with every k-matching in a Hamiltonian cycle.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Hamiltonian path; Combinatorics; Matching (statistics); Hamiltonian (control theory); Complete bipartite graph; Pancyclic graph; Discrete mathematics; Chordal graph; Graph; 1-planar graph; Statistics; Mathematical optimization","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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.0003384865,0.000139476,0.0001797294,0.0001296607,0.0001621896,0.00003328216,0.0002121454,0.00006232636,0.0000423895],"category_scores_gemma":[0.00004262377,0.0001209861,0.00004429393,0.0005602484,0.000148714,0.0001394022,0.00004439801,0.0001597835,0.00008859583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002311436,"about_ca_system_score_gemma":0.00002649212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003896665,"about_ca_topic_score_gemma":0.0001604002,"domain_scores_codex":[0.9990751,0.00006765979,0.0002125806,0.0002296802,0.0001496747,0.0002652849],"domain_scores_gemma":[0.9991544,0.0001909986,0.00008304937,0.0004429382,0.00005661272,0.00007199754],"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.00002365618,0.0001699878,0.003540121,0.00001480651,0.00001781456,0.000005045271,0.001260412,0.000001073243,0.0005591957,0.9939618,0.0003046933,0.000141402],"study_design_scores_gemma":[0.0005845077,0.0000852933,0.004862078,0.00007687502,0.00001589793,0.000006699405,0.0001442746,0.00003181089,0.001313794,0.9921901,0.0005229863,0.0001656516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9920146,0.00001668737,0.00004859841,0.0001497257,0.0001950563,0.0002237011,0.000002778286,0.0001142472,0.007234592],"genre_scores_gemma":[0.9980495,0.000003603104,0.001616443,0.00009449642,0.000007672052,0.00006714575,0.000002021724,0.00002691863,0.0001321918],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007102401,"threshold_uncertainty_score":0.4933668,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01734185081695378,"score_gpt":0.2751832019985619,"score_spread":0.2578413511816082,"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."}}