{"id":"W2952697189","doi":"10.48550/arxiv.1101.2630","title":"Minimum degree condition forcing complete graph immersion","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Disjoint sets; Complement graph; Graph power; Line graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007592714,0.0006171827,0.0008548545,0.0008613995,0.001278519,0.001615539,0.001003375,0.001632842,0.006966342],"category_scores_gemma":[0.006104033,0.0006301497,0.001210766,0.0006302489,0.002378442,0.003967091,0.004636975,0.003653388,0.0006923384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002040299,"about_ca_system_score_gemma":0.0006045838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001527993,"about_ca_topic_score_gemma":0.001837002,"domain_scores_codex":[0.9987469,0.0001995143,0.00005276946,0.0004468471,0.0003031846,0.0002509145],"domain_scores_gemma":[0.9950035,0.002533205,0.0003537538,0.0006195933,0.0006457926,0.0008441106],"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.0002907886,0.0001024605,0.001985586,0.0002829499,0.00004718734,0.0005929981,0.001531684,0.01426463,0.01795866,0.9435359,0.006113651,0.01329353],"study_design_scores_gemma":[0.00008403593,0.0001251609,0.001117027,0.00003267571,0.0000258235,0.0003727861,0.0003920795,0.04377871,0.005965124,0.936897,0.01117844,0.00003103635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7141653,0.0006688572,0.1903756,0.006142074,0.0002574529,0.0001950499,0.001532955,0.0009091831,0.08575351],"genre_scores_gemma":[0.9599191,0.0003267966,0.02441014,0.0005525691,0.000184518,0.0001208216,0.001027999,0.0001377317,0.01332032],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006966342,"threshold_uncertainty_score":0.02330476,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1731671707257376,"score_gpt":0.2335203467820918,"score_spread":0.06035317605635418,"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."}}