Image de couverture de livre

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bencs, Ferenc, Regts, Guus
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Discrete Mathematics Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Barvinok's interpolation method meets Weitz's correlation decay approach
par: Bencs, Ferenc, et autres
Publié: (2025)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
par: Bencs, Ferenc, et autres
Publié: (2024)

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
par: Jenssen, Matthew, et autres
Publié: (2023)

Approximating the volume of a truncated relaxation of the independence polytope
par: Bencs, Ferenc, et autres
Publié: (2024)

A near-optimal zero-free disk for the Ising model
par: Patel, Viresh, et autres
Publié: (2023)

On zeros and algorithms for disordered systems: mean-field spin glasses
par: Bencs, Ferenc, et autres
Publié: (2025)

Clique-free t-matchings in degree-bounded graphs
par: Paluch, Katarzyna, et autres
Publié: (2024)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
par: Majewski, Konrad, et autres
Publié: (2022)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
par: Bencs, Ferenc, et autres
Publié: (2023)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
par: Alecu, Bogdan, et autres
Publié: (2024)

Quasi-linear distance query reconstruction for graphs of bounded treelength
par: Bastide, Paul, et autres
Publié: (2024)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
par: Bonamy, Marthe, et autres
Publié: (2020)

On boundedness of zeros of the independence polynomial of tori
par: de Boer, David, et autres
Publié: (2023)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
par: Galby, Esther, et autres
Publié: (2025)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
par: An, Shinwoo, et autres
Publié: (2025)

Interval H-graphs : Recognition and forbidden obstructions
par: Müller, Haiko, et autres
Publié: (2025)

Max Weight Independent Set in sparse graphs with no long claws
par: Abrishami, Tara, et autres
Publié: (2023)

On the complex zeros and the computational complexity of approximating the reliability polynomial
par: Bencs, Ferenc, et autres
Publié: (2025)

Enumerating minimal solution sets for metric graph problems
par: Bergougnoux, Benjamin, et autres
Publié: (2023)

On the Houdré-Tetali conjecture about an isoperimetric constant of graphs
par: Lau, Lap Chi, et autres
Publié: (2024)

Holey graphs: very large Betti numbers are testable
par: Szabó, Dániel, et autres
Publié: (2024)

Designing sparse temporal graphs satisfying connectivity requirements
par: Bellitto, Thomas, et autres
Publié: (2026)

Improved bounds for coloring locally sparse hypergraphs
par: Iliopoulos, Fotis
Publié: (2020)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
par: Castelo, Emanuel, et autres
Publié: (2025)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
par: Deák, Bence, et autres
Publié: (2026)

Generating minimal redundant and maximal irredundant sets in incidence graphs
par: Castelo, Emanuel, et autres
Publié: (2026)

On the complexity of finding a spanning even tree in a graph
par: Hanaka, Tesshu, et autres
Publié: (2024)

Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
par: d'Orsi, Tommaso, et autres
Publié: (2024)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
par: Bourneuf, Romain, et autres
Publié: (2025)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
par: Ghanbari, Babak, et autres
Publié: (2025)

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
par: Arkhipov, Pavel, et autres
Publié: (2024)

A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
par: Chang, Yeonsu, et autres
Publié: (2023)

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
par: Le, Hoang-Oanh, et autres
Publié: (2024)

Cycle-factors of regular graphs via entropy
par: Christoph, Micha, et autres
Publié: (2025)

Towards Transitive-free Digraphs
par: Abhinav, Ankit, et autres
Publié: (2025)

Translating between the representations of an acyclic convex geometry of bounded degree
par: Defrain, Oscar, et autres
Publié: (2025)

Isometric path complexity of graphs
par: Chakraborty, Dibyayan, et autres
Publié: (2022)

Random Schreier graphs as expanders
par: Caillat-Grenier, Geoffroy
Publié: (2023)

Tree Independence Number IV. Even-hole-free Graphs
par: Chudnovsky, Maria, et autres
Publié: (2024)

On constrained intersection representations of graphs and digraphs
par: Cicalese, Ferdinando, et autres
Publié: (2025)