{"id":"W3089577182","doi":"10.1007/s00454-003-0012-9","title":"Unavoidable Configurations in Complete Topological Graphs","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Eidgenössische Technische Hochschule Zürich; Deutsche Forschungsgemeinschaft; Hungarian Scientific Research Fund; City University of New York; National Science Foundation","keywords":"Mathematics; Combinatorics; Topological graph; Discrete mathematics; Induced subgraph; Path graph; Graph homomorphism; Topological graph theory; Graph; Topology (electrical circuits); Line graph; Pathwidth; Graph power; 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.001025272,0.0007606047,0.001134921,0.002834262,0.00286523,0.003049306,0.002166235,0.00192302,0.008094205],"category_scores_gemma":[0.006367953,0.001205939,0.0009306095,0.002034127,0.004019795,0.005718926,0.003901064,0.003809051,0.0006474896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001185294,"about_ca_system_score_gemma":0.0005331311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007634308,"about_ca_topic_score_gemma":0.001381657,"domain_scores_codex":[0.9987476,0.0003173562,0.00006882363,0.0002945673,0.0003578794,0.0002137917],"domain_scores_gemma":[0.9956691,0.002224735,0.0006011969,0.0004717845,0.0003055264,0.0007276905],"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.00004356022,0.00002039328,0.0003888932,0.00004817145,0.000008948931,0.0001541536,0.0003291475,0.005637641,0.000491711,0.989511,0.0006917844,0.00267462],"study_design_scores_gemma":[0.00001070506,0.00001614615,0.0002071619,0.00001217514,0.000008329561,0.0001126321,0.000190286,0.00822464,0.0003029016,0.9898098,0.001096853,0.000008278007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6923692,0.000792812,0.2333119,0.001423084,0.0002481921,0.00008946907,0.0004493505,0.0005543462,0.0707616],"genre_scores_gemma":[0.9645823,0.0003427636,0.02564074,0.0001786972,0.0001314316,0.0001075748,0.0004133428,0.0001659999,0.008437151],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008094205,"threshold_uncertainty_score":0.02707779,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02263484183521906,"score_gpt":0.2668587935351035,"score_spread":0.2442239516998845,"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."}}