:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bernshteyn, Anton, Kaul, Hemanshu, Mudrock, Jeffrey A., Sharma, Gunjan
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2408.04538
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the DP-chromatic Number of Cartesian Products of Critical Graphs
by: Kaul, Hemanshu, et al.
Published: (2025)

Shameful Inequalities for List and DP Coloring of Graphs
by: Kaul, Hemanshu, et al.
Published: (2024)

On Strongly and Robustly Critical Graphs
by: Anton Bernshteyn, et al.
Published: (2026)

DP-Coloring of Graphs from Random Covers
by: Bernshteyn, Anton, et al.
Published: (2023)

Counting Packings of List-colorings of Graphs
by: Kaul, Hemanshu, et al.
Published: (2024)

Counting List Colorings of Unlabeled Graphs
by: Kaul, Hemanshu, et al.
Published: (2024)

List Coloring the Cartesian Product of a Complete Graph and Complete Bipartite Graph
by: Kaul, Hemanshu, et al.
Published: (2025)

A Note on Fractional DP-Coloring of Graphs
by: Dominik, Daniel, et al.
Published: (2019)

Flexible list colorings: Maximizing the number of requests satisfied
by: Kaul, Hemanshu, et al.
Published: (2022)

A Polynomial Method for Counting Colorings of Sparse Graphs
by: Dahlberg, Samantha L., et al.
Published: (2023)

On Polynomial Representations of the DP Color Function: Theta Graphs and Their Generalizations
by: Halberg, Charlie, et al.
Published: (2020)

Borel line graphs
by: Anderson, James, et al.
Published: (2023)

Embedding Borel graphs into grids of asymptotically optimal dimension
by: Bernshteyn, Anton, et al.
Published: (2024)

Large-scale geometry of Borel graphs of polynomial growth
by: Bernshteyn, Anton, et al.
Published: (2023)

Coloring graphs with forbidden almost bipartite subgraphs
by: Anderson, James, et al.
Published: (2022)

Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index
by: Bernshteyn, Anton, et al.
Published: (2023)

Fast algorithms for Vizing's theorem on bounded degree graphs
by: Bernshteyn, Anton, et al.
Published: (2023)

Borel Local Lemma: arbitrary random variables and limited exponential growth
by: Bernshteyn, Anton, et al.
Published: (2024)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
by: Bernshteyn, Anton, et al.
Published: (2024)

Borel Vizing's Theorem for Graphs of Subexponential Growth
by: Bernshteyn, Anton, et al.
Published: (2023)

Weak Degeneracy of Planar Graphs
by: Bernshteyn, Anton, et al.
Published: (2024)

On Polynomial Representations of Dual DP Color Functions
by: Mudrock, Jeffrey A., et al.
Published: (2024)

Enumerative Chromatic Choosability
by: Allred, Sarah, et al.
Published: (2025)

Fractional Strict Degeneracy of Graphs
by: Dominik, Daniel, et al.
Published: (2026)

Flexible list colorings: Maximizing the number of requests satisfied
by: Hemanshu Kaul, et al.
Published: (2024)

A Spectral Turán Problem for a Fixed Tree
by: Desai, Dheer Noal, et al.
Published: (2025)

Separating complexity classes of LCL problems on grids
by: Berlow, Katalin, et al.
Published: (2025)

Sunflowers in set systems with small VC-dimension
by: Balogh, József, et al.
Published: (2024)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

On the Ohba Number and Generalized Ohba Numbers of Complete Bipartite Graphs
by: Cano, Kennedy, et al.
Published: (2024)

Enumeratively Chromatic-Choosable Theta Graphs
by: Chi, Yanghong, et al.
Published: (2026)

Note on robust coloring of planar graphs
by: Kardoš, František, et al.
Published: (2024)

On strong odd colorings of graphs
by: Caro, Yair, et al.
Published: (2024)

Flow-critical graphs
by: Árnadóttir, Arnbjörg Soffía, et al.
Published: (2025)

Hoffman colorability of (strongly) regular graphs
by: Abiad, Aida, et al.
Published: (2025)

An Ohba-like Result for Flexible List Coloring
by: Bowdoin, Michael C., et al.
Published: (2025)

Connectivity of contraction-critical graphs
by: Lafferty, Michael, et al.
Published: (2025)

Extremal graphs for disjoint union of vertex-critical graphs
by: Zhang, Wenqian
Published: (2025)

Size conditions and spectral conditions for generalized factor-critical (bicritical) graphs and $k$-$d$-critical graphs
by: Zhang, Zhenhao, et al.
Published: (2026)

On strong nodal domains for eigenfunctions of Hamming graphs
by: Valyuzhenich, Alexandr, et al.
Published: (2025)