Marcin Anholcer , Bartłomiej Bosek , Jarosław Grytczuk , Grzegorz Gutowski , Jakub Przybyło , Mariusz Zając
{"title":"正确的太太和大多数的颜色","authors":"Marcin Anholcer , Bartłomiej Bosek , Jarosław Grytczuk , Grzegorz Gutowski , Jakub Przybyło , Mariusz Zając","doi":"10.1016/j.disc.2025.114577","DOIUrl":null,"url":null,"abstract":"<div><div>A <em>majority coloring</em> of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techniques and generalize previously known results on various generalizations of majority coloring. In particular, our unified and simplified approach works for <em>paintability</em> – an on-line analog of the list coloring.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 11","pages":"Article 114577"},"PeriodicalIF":0.7000,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Mrs. Correct and majority colorings\",\"authors\":\"Marcin Anholcer , Bartłomiej Bosek , Jarosław Grytczuk , Grzegorz Gutowski , Jakub Przybyło , Mariusz Zając\",\"doi\":\"10.1016/j.disc.2025.114577\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>A <em>majority coloring</em> of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techniques and generalize previously known results on various generalizations of majority coloring. In particular, our unified and simplified approach works for <em>paintability</em> – an on-line analog of the list coloring.</div></div>\",\"PeriodicalId\":50572,\"journal\":{\"name\":\"Discrete Mathematics\",\"volume\":\"348 11\",\"pages\":\"Article 114577\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2025-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0012365X25001852\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X25001852","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
A majority coloring of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techniques and generalize previously known results on various generalizations of majority coloring. In particular, our unified and simplified approach works for paintability – an on-line analog of the list coloring.
期刊介绍:
Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.
Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.