{"id":"W2043020651","doi":"10.1016/s0012-365x(03)00084-0","title":"On upper domination Ramsey numbers for graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Ramsey's theorem; Mathematics; Domination analysis; Graph; Independence number; Integer (computer science); Dominating set; Upper and lower bounds; Cardinality (data modeling); Discrete mathematics; 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.004030835,0.001318475,0.001788617,0.004595892,0.003386637,0.00529951,0.002430443,0.001718296,0.01360221],"category_scores_gemma":[0.0159456,0.001023905,0.001048269,0.00434206,0.005235113,0.01428653,0.005066092,0.006823673,0.001230011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003145169,"about_ca_system_score_gemma":0.001016542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001558402,"about_ca_topic_score_gemma":0.002581477,"domain_scores_codex":[0.9982331,0.0004926904,0.00008176653,0.0003391102,0.0004503078,0.0004030436],"domain_scores_gemma":[0.9819318,0.01407893,0.000910977,0.001089117,0.0006850155,0.001304268],"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.0001915359,0.00005684698,0.0006476432,0.0001342259,0.0000138144,0.00005318263,0.000605732,0.003556812,0.000957182,0.9747107,0.003993508,0.01507878],"study_design_scores_gemma":[0.00001812535,0.00001817936,0.0003749923,0.0000343703,0.00001157978,0.00005253615,0.0001011815,0.005082288,0.0003038094,0.9914128,0.002574331,0.0000157639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4804792,0.008601656,0.2337097,0.01060116,0.0008755241,0.0001538818,0.001167014,0.0009724888,0.2634394],"genre_scores_gemma":[0.9305875,0.004021445,0.03496765,0.00153896,0.001087951,0.0002914456,0.0006945042,0.0002795581,0.02653097],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01360221,"threshold_uncertainty_score":0.04550385,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02098316730681271,"score_gpt":0.3109859675149543,"score_spread":0.2900028002081416,"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."}}