Cover Image

Fractional coloring with local demands and applications to degree-sequence bounds on the independence number

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kelly, Tom, Postle, Luke
Format:	Preprint
Published:	2018
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The chromatic number of triangle-free hypergraphs
by: Li, Lina, et al.
Published: (2022)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

Fractional domatic number and minimum degree
by: Chuet, Quentin, et al.
Published: (2025)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

Balanced independent sets and colorings of hypergraphs
by: Dhawan, Abhishek
Published: (2023)

Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)

Fractional coloring via entropy
by: Dhawan, Abhishek
Published: (2026)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)

Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
by: Gutin, Gregory, et al.
Published: (2024)

Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs
by: Delcourt, Michelle, et al.
Published: (2021)

Induced matching treewidth and tree-independence number, revisited
by: Alon, Noga, et al.
Published: (2025)

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

On expectations and variances in the hard-core model on bounded degree graphs
by: Davies, Ewan, et al.
Published: (2025)

Strong odd colorings in graph classes of bounded expansion
by: Pilipczuk, Michał
Published: (2025)

Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Winding number and circular 4-coloring of signed graphs
by: Gujgiczer, Anna, et al.
Published: (2023)

Tree-independence number of $P_5$-free graphs with no large bicliques
by: Blažej, Václav, et al.
Published: (2026)

Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)

A new vertex coloring heuristic and corresponding chromatic number
by: Zaker, Manouchehr
Published: (2020)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

Multigraph edge-coloring with local list sizes
by: Dhawan, Abhishek
Published: (2023)

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

Improved bounds for coloring locally sparse hypergraphs
by: Iliopoulos, Fotis
Published: (2020)

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)

On the generalized coloring numbers
by: Siebertz, Sebastian
Published: (2025)

Flips in colorful triangulations
by: Acharya, Rohan, et al.
Published: (2024)

Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)

On the geometric $k$-colored crossing number of $K_n$
by: Hahn, Benedikt, et al.
Published: (2025)

Some progress on $t$-tone coloring
by: Bennett, Patrick, et al.
Published: (2025)

Generalized DP-colorings of digraphs
by: Picasarri-Arrieta, Lucas, et al.
Published: (2025)

Equitable coloring of sparse graphs
by: Liu, Weichan, et al.
Published: (2024)

Graceful coloring is computationally hard
by: Antony, Cyriac, et al.
Published: (2024)

On near optimal colorable graphs
by: Angeliya, C. U., et al.
Published: (2025)

Two questions on Kneser colorings
by: Inozemtsev, Eduard, et al.
Published: (2024)

Nucleation-free independent graphs with implied nonedges
by: Cheng, Jialong, et al.
Published: (2025)

ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)