Academic Journal
Asymptotically Optimal Proper Conflict‐Free Coloring: Asymptotically optimal proper conflict-free coloring
| Title: | Asymptotically Optimal Proper Conflict‐Free Coloring: Asymptotically optimal proper conflict-free coloring |
|---|---|
| Authors: | Chun‐Hung Liu, Bruce Reed |
| Source: | Random Structures & Algorithms. 66 |
| Publication Status: | Preprint |
| Publisher Information: | Wiley, 2025. |
| Publication Year: | 2025 |
| Subject Terms: | Connectivity, Extremal problems in graph theory, graph colouring, Coloring of graphs and hypergraphs, Lovász local lemma, FOS: Mathematics, Mathematics - Combinatorics, Vertex degrees, 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, quasi-random method, 01 natural sciences |
| Description: | A proper conflict‐free coloring of a graph is a coloring of the vertices such that any two adjacent vertices receive different colors, and for every non‐isolated vertex , some color appears exactly once on the neighborhood of . Caro, Petruševski and Škrekovski conjectured that every connected graph with maximum degree has a proper conflict‐free coloring with at most colors. This conjecture holds for and remains open for . In this article we prove that this conjecture holds asymptotically; namely, every graph with maximum degree has a proper conflict‐free coloring with colors. |
| Document Type: | Article |
| File Description: | application/xml |
| Language: | English |
| ISSN: | 1098-2418 1042-9832 |
| DOI: | 10.1002/rsa.21285 |
| DOI: | 10.48550/arxiv.2401.02155 |
| Access URL: | http://arxiv.org/abs/2401.02155 https://zbmath.org/8036330 https://doi.org/10.1002/rsa.21285 |
| Rights: | Wiley Online Library User Agreement arXiv Non-Exclusive Distribution |
| Accession Number: | edsair.doi.dedup.....d2e50859fae5d4b00b6703a1a93fa77f |
| Database: | OpenAIRE |
| FullText | Links: – Type: other Url: https://resolver.ebsco.com:443/public/rma-ftfapi/ejs/direct?AccessToken=4A6B875B45E088427174&Show=Object Text: Availability: 0 CustomLinks: – Url: https://explore.openaire.eu/search/publication?articleId=doi_dedup___%3A%3Ad2e50859fae5d4b00b6703a1a93fa77f Name: EDS - OpenAIRE (ns324271) Category: fullText Text: View record at OpenAIRE |
|---|---|
| Header | DbId: edsair DbLabel: OpenAIRE An: edsair.doi.dedup.....d2e50859fae5d4b00b6703a1a93fa77f RelevancyScore: 982 AccessLevel: 3 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 982.488952636719 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Asymptotically Optimal Proper Conflict‐Free Coloring: Asymptotically optimal proper conflict-free coloring – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Chun‐Hung+Liu%22">Chun‐Hung Liu</searchLink><br /><searchLink fieldCode="AR" term="%22Bruce+Reed%22">Bruce Reed</searchLink> – Name: TitleSource Label: Source Group: Src Data: <i>Random Structures & Algorithms</i>. 66 – Name: Publisher Label: Publication Status Group: PubInfo Data: Preprint – Name: Publisher Label: Publisher Information Group: PubInfo Data: Wiley, 2025. – Name: DatePubCY Label: Publication Year Group: Date Data: 2025 – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Connectivity%22">Connectivity</searchLink><br /><searchLink fieldCode="DE" term="%22Extremal+problems+in+graph+theory%22">Extremal problems in graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22graph+colouring%22">graph colouring</searchLink><br /><searchLink fieldCode="DE" term="%22Coloring+of+graphs+and+hypergraphs%22">Coloring of graphs and hypergraphs</searchLink><br /><searchLink fieldCode="DE" term="%22Lovász+local+lemma%22">Lovász local lemma</searchLink><br /><searchLink fieldCode="DE" term="%22FOS%3A+Mathematics%22">FOS: Mathematics</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematics+-+Combinatorics%22">Mathematics - Combinatorics</searchLink><br /><searchLink fieldCode="DE" term="%22Vertex+degrees%22">Vertex degrees</searchLink><br /><searchLink fieldCode="DE" term="%220102+computer+and+information+sciences%22">0102 computer and information sciences</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatorics+%28math%2ECO%29%22">Combinatorics (math.CO)</searchLink><br /><searchLink fieldCode="DE" term="%220101+mathematics%22">0101 mathematics</searchLink><br /><searchLink fieldCode="DE" term="%22quasi-random+method%22">quasi-random method</searchLink><br /><searchLink fieldCode="DE" term="%2201+natural+sciences%22">01 natural sciences</searchLink> – Name: Abstract Label: Description Group: Ab Data: A proper conflict‐free coloring of a graph is a coloring of the vertices such that any two adjacent vertices receive different colors, and for every non‐isolated vertex , some color appears exactly once on the neighborhood of . Caro, Petruševski and Škrekovski conjectured that every connected graph with maximum degree has a proper conflict‐free coloring with at most colors. This conjecture holds for and remains open for . In this article we prove that this conjecture holds asymptotically; namely, every graph with maximum degree has a proper conflict‐free coloring with colors. – Name: TypeDocument Label: Document Type Group: TypDoc Data: Article – Name: Format Label: File Description Group: SrcInfo Data: application/xml – Name: Language Label: Language Group: Lang Data: English – Name: ISSN Label: ISSN Group: ISSN Data: 1098-2418<br />1042-9832 – Name: DOI Label: DOI Group: ID Data: 10.1002/rsa.21285 – Name: DOI Label: DOI Group: ID Data: 10.48550/arxiv.2401.02155 – Name: URL Label: Access URL Group: URL Data: <link linkTarget="URL" linkTerm="http://arxiv.org/abs/2401.02155" linkWindow="_blank">http://arxiv.org/abs/2401.02155</link><br /><link linkTarget="URL" linkTerm="https://zbmath.org/8036330" linkWindow="_blank">https://zbmath.org/8036330</link><br /><link linkTarget="URL" linkTerm="https://doi.org/10.1002/rsa.21285" linkWindow="_blank">https://doi.org/10.1002/rsa.21285</link> – Name: Copyright Label: Rights Group: Cpyrght Data: Wiley Online Library User Agreement<br />arXiv Non-Exclusive Distribution – Name: AN Label: Accession Number Group: ID Data: edsair.doi.dedup.....d2e50859fae5d4b00b6703a1a93fa77f |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsair&AN=edsair.doi.dedup.....d2e50859fae5d4b00b6703a1a93fa77f |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1002/rsa.21285 Languages: – Text: English Subjects: – SubjectFull: Connectivity Type: general – SubjectFull: Extremal problems in graph theory Type: general – SubjectFull: graph colouring Type: general – SubjectFull: Coloring of graphs and hypergraphs Type: general – SubjectFull: Lovász local lemma Type: general – SubjectFull: FOS: Mathematics Type: general – SubjectFull: Mathematics - Combinatorics Type: general – SubjectFull: Vertex degrees Type: general – SubjectFull: 0102 computer and information sciences Type: general – SubjectFull: Combinatorics (math.CO) Type: general – SubjectFull: 0101 mathematics Type: general – SubjectFull: quasi-random method Type: general – SubjectFull: 01 natural sciences Type: general Titles: – TitleFull: Asymptotically Optimal Proper Conflict‐Free Coloring: Asymptotically optimal proper conflict-free coloring Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Chun‐Hung Liu – PersonEntity: Name: NameFull: Bruce Reed IsPartOfRelationships: – BibEntity: Dates: – D: 26 M: 04 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 10982418 – Type: issn-print Value: 10429832 – Type: issn-locals Value: edsair – Type: issn-locals Value: edsairFT Numbering: – Type: volume Value: 66 Titles: – TitleFull: Random Structures & Algorithms Type: main |
| ResultId | 1 |