{"id":"W4245919572","doi":"10.1002/rsa.20123","title":"Regular subgraphs of random graphs","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random regular graph; Combinatorics; struct; Mathematics; Graph; Random graph; Regular graph; Strongly regular graph; Discrete mathematics; Constant (computer programming); Line graph; Pathwidth; Graph power; Computer science","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.001275214,0.0003032526,0.000622633,0.001501034,0.0007659555,0.001118161,0.0007860003,0.0006135646,0.002195538],"category_scores_gemma":[0.01192323,0.000450157,0.0005822345,0.0006236177,0.001642823,0.001862458,0.00151117,0.0008047681,0.000286484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000882955,"about_ca_system_score_gemma":0.0003850987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008659038,"about_ca_topic_score_gemma":0.000741092,"domain_scores_codex":[0.9986532,0.0005208277,0.00005724782,0.0002590094,0.0003334951,0.0001762489],"domain_scores_gemma":[0.9899767,0.005485606,0.001760952,0.001396776,0.0007162651,0.0006638188],"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.0006924726,0.0001393928,0.01452756,0.0003531221,0.0001421007,0.001032385,0.001138192,0.08038769,0.01535038,0.8438443,0.005973579,0.03641885],"study_design_scores_gemma":[0.00008989518,0.0001401174,0.003289862,0.00005194643,0.00005171821,0.001052512,0.0002052058,0.3154507,0.006361345,0.6684701,0.004807665,0.0000288933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8304664,0.000565601,0.1541249,0.0008444058,0.0000487735,0.0001151491,0.0002818355,0.0004685032,0.01308437],"genre_scores_gemma":[0.9896111,0.0001445545,0.008515707,0.0001263726,0.00003940344,0.00005702195,0.0001772307,0.00004659836,0.001282034],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002195538,"threshold_uncertainty_score":0.007344782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01111309453741431,"score_gpt":0.2513121485370848,"score_spread":0.2401990539996705,"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."}}