Papers
Topics
Authors
Recent
Search
2000 character limit reached

Relation between the correspondence chromatic number and the Alon--Tarsi number

Published 23 Jun 2022 in math.CO | (2206.11964v1)

Abstract: We study the relation between the correspondence chromatic number and the Alon--Tarsi number, both upper bounds on the list chromatic number of a graph. There are many graphs with Alon--Tarsi number greater than the correspondence chromatic number. We present here a family of graphs with arbitrary Alon--Tarsi number, with correspondence chromatic number one larger. Keywords: correspondence coloring, Alon--Tarsi number AMS Mathematics Subject Classification: 05C15

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Eric Culver 
  2. Stephen Hartke 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up