Image de couverture de livre

Tightness of a MaxCut Lower Bound via Vector Chromatic Number

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Juliano, Emanuel
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Nearly tight bounds for MaxCut in hypergraphs
par: Janzer, Oliver, et autres
Publié: (2025)

Beyond the MaxCut problem in $H$-free graphs
par: Jin, Zhihan, et autres
Publié: (2025)

Factorization norms and an inverse theorem for MaxCut
par: Balla, Igor, et autres
Publié: (2025)

Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
par: Farhi, Edward, et autres
Publié: (2025)

Asymptotically Tight Bound for the Conflict-Free Chromatic Index
par: Kamyczura, Mateusz, et autres
Publié: (2026)

A Spectral Lower Bound on Chromatic Numbers using $p$-Energy
par: Elphick, Clive, et autres
Publié: (2025)

Tight Bounds on the Chromatic Edge Stability Index of Graphs
par: Akbari, Saieed, et autres
Publié: (2022)

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
par: Goetze, Miriam, et autres
Publié: (2025)

Upper Bounds of the Odd Chromatic Number of a Graph in terms of its Thickness
par: Kitano, S.
Publié: (2024)

Forbidden subdivision in integral trees
par: Juliano, Emanuel
Publié: (2024)

Toward Lower Bounds for Chromatic Symmetric Functions in the Elementary Basis
par: Siegl, Isaiah
Publié: (2025)

Lower Bounds for Maximum Weighted Cut
par: Gutin, Gregory, et autres
Publié: (2021)

New Eigenvalue Bound for the Fractional Chromatic Number
par: Guo, Krystal, et autres
Publié: (2022)

Lower Bounds for Book Ramsey Numbers
par: Wesley, William J.
Publié: (2024)

An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs
par: Aldi, Marco, et autres
Publié: (2025)

A Lower Bound for the Max Entropy Algorithm for TSP
par: Jin, Billy, et autres
Publié: (2023)

Upper Chromatic Numbers: An Update
par: Abrams, Aaron
Publié: (2025)

Improved Lower Bound on the Number of Pseudoline Arrangements
par: Dallant, Justin
Publié: (2024)

The Matching Kneser Graph Conjecture For High Chromatic Numbers
par: Shaebani, Saeed
Publié: (2023)

Geometrization of Graphs: Towards Bounding the Chromatic Number via High-Dimensional Embedding
par: Fang, Qiming, et autres
Publié: (2024)

Spectral upper bounds for the Grundy number of a graph
par: Assis, Thiago, et autres
Publié: (2024)

Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut
par: Bakshi, Ainesh, et autres
Publié: (2026)

A Tight Lower bound on Trees in Graphs
par: Wilson, Chase
Publié: (2025)

Upper Bounds on the Chromatic Index of Linear Hypergraphs
par: Murff, Thomas, et autres
Publié: (2025)

Chromatic Number of Grassmann Graphs and MRD codes
par: D'haeseleer, Jozefien, et autres
Publié: (2026)

MaxCut in Graphs With Sparse Neighborhoods
par: Jinghua Deng, et autres
Publié: (2026)

Lower Bounds on Face Numbers of Polytopes with $m$ Facets
par: Hinman, Joshua
Publié: (2024)

The Chromatic Number of Kneser Hypergraphs via Consensus Division
par: Haviv, Ishay
Publié: (2023)

On the Chromatic Number of Stable Kneser Hypergraphs: Verifying the Conjecture for New Families
par: Daneshpajouh, Hamid Reza
Publié: (2025)

Lower and Upper Bounds for Small Canonical and Ordered Ramsey Numbers
par: Brosch, Daniel, et autres
Publié: (2025)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
par: Charvy, Gaspard, et autres
Publié: (2025)

Tight Bounds for the Number of Absent Subsequences
par: Adamson, Duncan, et autres
Publié: (2024)

Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs
par: Anto, Nevil, et autres
Publié: (2023)

Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree
par: Galindo, Rachel, et autres
Publié: (2025)

Treewidth Inapproximability and Tight ETH Lower Bound
par: Bonnet, Édouard
Publié: (2024)

The $k^{\text th}$ Upper Chromatic Number of the Line
par: Abrams, Aaron
Publié: (2025)

Yet Another Species of Forbidden-distances Chromatic Number
par: Abrams, Aaron, et autres
Publié: (2025)

Quantum Max Cut for complete tripartite graphs
par: Štrekelj, Tea
Publié: (2025)

A General Lower Bound for the Limited Augmented Zarankiewicz Number based upon Complete Graphs
par: Qi, Liqun, et autres
Publié: (2026)

A Tight Lower Bound on Cubic Vertices and Upper Bounds on Thin and Non-thin edges in Planar Braces
par: De, Koustav
Publié: (2025)