{"id":"W2175518075","doi":"10.1016/j.disc.2003.05.001","title":"Induced matchings in intersection graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Indifference graph; Split graph; Block graph; Discrete mathematics; Pathwidth; Induced subgraph; Intersection graph; Matching (statistics); Interval graph; 1-planar graph; Cograph; Line graph; Graph; Vertex (graph theory)","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.001445428,0.0006089981,0.001380794,0.003879402,0.003465623,0.005722569,0.002755654,0.002170136,0.0140622],"category_scores_gemma":[0.008498328,0.001383496,0.001358011,0.006120078,0.002309907,0.01275832,0.0035276,0.004050708,0.001775228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00203093,"about_ca_system_score_gemma":0.0009476664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001349552,"about_ca_topic_score_gemma":0.001464275,"domain_scores_codex":[0.9980429,0.0004316753,0.0001466782,0.0004950346,0.0005360774,0.0003474709],"domain_scores_gemma":[0.9935569,0.003136626,0.001064716,0.0007279522,0.000710888,0.0008029538],"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.0001323323,0.00009796055,0.0009921155,0.00007927007,0.00002286595,0.0001122929,0.0005099595,0.001496011,0.0008399452,0.9811952,0.001981449,0.01254051],"study_design_scores_gemma":[0.00002908031,0.00001979317,0.0003651145,0.00002480842,0.00004091501,0.0001422984,0.0002486936,0.007916015,0.0009348018,0.9864606,0.003805812,0.00001210666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6140175,0.001159191,0.2619074,0.002346947,0.0002701615,0.0002307829,0.001537465,0.001182436,0.1173482],"genre_scores_gemma":[0.9122486,0.0009200334,0.05430849,0.0004347505,0.0002334258,0.0002024529,0.00207294,0.0003556834,0.02922381],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0140622,"threshold_uncertainty_score":0.04704273,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02698763385987632,"score_gpt":0.3014352730218232,"score_spread":0.2744476391619469,"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."}}