{"id":"W2245479836","doi":"10.1016/j.dam.2016.06.025","title":"A sharp lower bound on the number of non-equivalent colorings of graphs of order <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si8.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math> and maximum degree <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mn>3</mml:mn></mml:math>","year":2016,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Fédération Wallonie-Bruxelles; Polytechnique Montréal","keywords":"Combinatorics; Mathematics; Partition (number theory); Vertex (graph theory); Upper and lower bounds; Graph; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.004870363,0.003569798,0.003358648,0.003390379,0.004015957,0.007942385,0.007315063,0.00368529,0.02502659],"category_scores_gemma":[0.03258686,0.002167762,0.003324445,0.002990809,0.006065379,0.01252308,0.005571164,0.008808777,0.00442648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004798465,"about_ca_system_score_gemma":0.002395654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002115803,"about_ca_topic_score_gemma":0.003395875,"domain_scores_codex":[0.9926364,0.002023205,0.0003206919,0.002131097,0.001417472,0.001471058],"domain_scores_gemma":[0.9371635,0.0469315,0.002719015,0.006412242,0.00223322,0.004540487],"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.003565836,0.0006454411,0.01215939,0.002555468,0.0006041602,0.0006412069,0.001250977,0.07577009,0.01697581,0.7379406,0.07962389,0.06826715],"study_design_scores_gemma":[0.0003065899,0.0002762157,0.004145378,0.0002079989,0.0003185047,0.00110851,0.0003214192,0.1209323,0.005209308,0.8531391,0.01391697,0.0001175994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.435938,0.008530366,0.3197311,0.02867715,0.001948223,0.0004089032,0.01166878,0.00263858,0.1904588],"genre_scores_gemma":[0.8504336,0.003669901,0.09308179,0.003644889,0.002194883,0.0006983294,0.009609885,0.001291388,0.03537539],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02502659,"threshold_uncertainty_score":0.08372229,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02050798474540309,"score_gpt":0.2445616787994044,"score_spread":0.2240536940540013,"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."}}