{"id":"W2155131920","doi":"10.1007/s10114-010-9006-6","title":"The existence of even regular factors of regular graphs on the number of cut edges","year":2010,"lang":"en","type":"article","venue":"Acta Mathematica Sinica English Series","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge; Wilfrid Laurier University","funders":"","keywords":"Multigraph; Combinatorics; Integer (computer science); Mathematics; Factor (programming language); Characterization (materials science); Discrete mathematics; Two-graph; Graph; Computer science; Physics; Line graph","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.001256149,0.0009765094,0.001325027,0.002402308,0.001401037,0.003649272,0.001388341,0.001204052,0.007589903],"category_scores_gemma":[0.01080146,0.001180018,0.001173026,0.001345958,0.003767858,0.004986467,0.001613245,0.00204037,0.0007508951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001049614,"about_ca_system_score_gemma":0.0007091454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001391489,"about_ca_topic_score_gemma":0.001418092,"domain_scores_codex":[0.9990242,0.0002143976,0.00004464274,0.0003189884,0.00016738,0.0002305131],"domain_scores_gemma":[0.9910731,0.005219142,0.00109049,0.0006510958,0.0006598302,0.001306408],"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.0004709618,0.00006519206,0.002565633,0.0001854176,0.00004136776,0.0002794667,0.000583835,0.002895293,0.004506812,0.9742443,0.002647115,0.01151473],"study_design_scores_gemma":[0.00005711228,0.00003492936,0.001211414,0.00003618053,0.00004734012,0.0002854602,0.0001959,0.009675642,0.001025619,0.985298,0.002099435,0.0000329778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8243789,0.001816521,0.09875649,0.001533188,0.00030683,0.00005938196,0.0005721597,0.00044894,0.07212749],"genre_scores_gemma":[0.9695067,0.0009635699,0.0184452,0.0002803132,0.0003103542,0.00006935612,0.0003307021,0.0002398584,0.009853918],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007589903,"threshold_uncertainty_score":0.02539074,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02358314849516185,"score_gpt":0.2832969816802185,"score_spread":0.2597138331850566,"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."}}