{"id":"W2109408352","doi":"10.1016/j.disc.2015.10.008","title":"Triangle-free graphs with the maximum number of cycles","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Upper and lower bounds; Triangle-free graph; Pancyclic graph; Discrete mathematics; Graph; Complete bipartite graph; 1-planar graph; Chordal 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.0007024084,0.0005986285,0.0008419625,0.001935372,0.001472871,0.003021061,0.001969405,0.001606988,0.01073892],"category_scores_gemma":[0.006823745,0.0008071228,0.0006696861,0.001789754,0.001901879,0.00556478,0.001970054,0.001844987,0.001113471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001089579,"about_ca_system_score_gemma":0.0007029515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001425598,"about_ca_topic_score_gemma":0.002096878,"domain_scores_codex":[0.999167,0.0002071671,0.00004780869,0.0001865075,0.000232558,0.0001591107],"domain_scores_gemma":[0.9939517,0.003328794,0.0005950903,0.0006818939,0.0006495052,0.0007928956],"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.0001142118,0.00002851875,0.0005802786,0.00009111495,0.00001419664,0.0001494591,0.0002301172,0.00300707,0.002952117,0.980243,0.002325363,0.01026451],"study_design_scores_gemma":[0.00002369663,0.0000134271,0.0002155508,0.00001995616,0.00001066098,0.0001810097,0.00009599516,0.00803214,0.001203796,0.98765,0.002544175,0.000009737997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6069943,0.001976058,0.2126906,0.003414674,0.0002840066,0.0001276177,0.0009939407,0.0006440963,0.1728747],"genre_scores_gemma":[0.9446682,0.0008810579,0.0315208,0.0004802529,0.0001864201,0.000138153,0.0004870245,0.0002000404,0.02143805],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01073892,"threshold_uncertainty_score":0.03592521,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0421209842775522,"score_gpt":0.3022750133111788,"score_spread":0.2601540290336267,"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."}}