{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004221452,0.0005464887,0.0007418455,0.0009842812,0.002361799,0.002026371,0.001384683,0.002098419,0.02562487],"category_scores_gemma":[0.003037411,0.0006709088,0.0008358876,0.00155606,0.001355608,0.003829206,0.002264435,0.001713495,0.00463529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006645347,"about_ca_system_score_gemma":0.0008443346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001226248,"about_ca_topic_score_gemma":0.001624517,"domain_scores_codex":[0.9992545,0.0001679204,0.00004999195,0.0002303207,0.0001042379,0.0001929202],"domain_scores_gemma":[0.9984331,0.0004671185,0.0003060614,0.0002971265,0.0002140059,0.0002826225],"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.0003303288,0.0001667902,0.001176627,0.0003964146,0.00008777375,0.0007756308,0.000487622,0.002284515,0.008416519,0.9418359,0.01772741,0.02631448],"study_design_scores_gemma":[0.00006356549,0.00004194629,0.0009713392,0.00007396568,0.000064284,0.000789813,0.0003934823,0.00722564,0.002421056,0.9695431,0.01838713,0.00002455675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4599884,0.001438045,0.2407428,0.004158907,0.0009754763,0.0003769874,0.005294658,0.00116853,0.2858562],"genre_scores_gemma":[0.8723121,0.000702764,0.06496006,0.00137388,0.0002895163,0.0003319839,0.003310736,0.0002828132,0.05643616],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02562487,"threshold_uncertainty_score":0.08572376,"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."}}