{"id":"W1979477295","doi":"10.1016/j.disc.2004.07.022","title":"The graphs with maximum induced matching and maximum matching the same size","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary; Wilfrid Laurier University","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Factor-critical graph; Characterization (materials science); 3-dimensional matching; Graph; Cograph; Discrete mathematics; Simple (philosophy); Line graph; Bipartite graph; Pathwidth; Voltage graph; Statistics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137076,0.0002893414,0.0002507255,0.00006423406,0.001060618,0.0008117936,0.001707307,0.00006293865,0.000008836902],"category_scores_gemma":[0.0001352856,0.0001413647,0.00008152947,0.0004670299,0.0003089224,0.0004897634,0.0006782555,0.0005325738,0.00003334093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003464844,"about_ca_system_score_gemma":0.00004312828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001475642,"about_ca_topic_score_gemma":0.00007121082,"domain_scores_codex":[0.9977395,0.0001597186,0.0003666757,0.0003969815,0.0007028546,0.0006342935],"domain_scores_gemma":[0.9964634,0.001852484,0.000198372,0.001272133,0.00007758697,0.0001359808],"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.00001980044,0.00003769434,0.00004066345,0.00005579837,0.0000649858,0.00001196464,0.01165366,0.0001289367,0.001149478,0.9618728,0.00004304417,0.02492122],"study_design_scores_gemma":[0.0002850938,0.00006608992,0.0001960802,0.00007703924,0.00001331911,0.0001100693,0.00255597,0.00416567,0.0005674522,0.9911341,0.0005816921,0.000247434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.610083,0.0003473746,0.3744557,0.009675459,0.000106384,0.0007894289,0.000005195786,0.0002678291,0.004269646],"genre_scores_gemma":[0.8503585,0.00007538988,0.1484765,0.0004344567,0.00005907327,0.00006684681,7.171297e-7,0.00005032181,0.0004781325],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2402756,"threshold_uncertainty_score":0.815752,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01902994736410249,"score_gpt":0.279226662895465,"score_spread":0.2601967155313625,"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."}}