Saved in:
| Main Author: | Juliano, Emanuel |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.29176 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Nearly tight bounds for MaxCut in hypergraphs
by: Janzer, Oliver, et al.
Published: (2025)
by: Janzer, Oliver, et al.
Published: (2025)
Beyond the MaxCut problem in $H$-free graphs
by: Jin, Zhihan, et al.
Published: (2025)
by: Jin, Zhihan, et al.
Published: (2025)
Factorization norms and an inverse theorem for MaxCut
by: Balla, Igor, et al.
Published: (2025)
by: Balla, Igor, et al.
Published: (2025)
Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
by: Farhi, Edward, et al.
Published: (2025)
by: Farhi, Edward, et al.
Published: (2025)
Asymptotically Tight Bound for the Conflict-Free Chromatic Index
by: Kamyczura, Mateusz, et al.
Published: (2026)
by: Kamyczura, Mateusz, et al.
Published: (2026)
A Spectral Lower Bound on Chromatic Numbers using $p$-Energy
by: Elphick, Clive, et al.
Published: (2025)
by: Elphick, Clive, et al.
Published: (2025)
Tight Bounds on the Chromatic Edge Stability Index of Graphs
by: Akbari, Saieed, et al.
Published: (2022)
by: Akbari, Saieed, et al.
Published: (2022)
Forbidden subdivision in integral trees
by: Juliano, Emanuel
Published: (2024)
by: Juliano, Emanuel
Published: (2024)
The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
Upper Bounds of the Odd Chromatic Number of a Graph in terms of its Thickness
by: Kitano, S.
Published: (2024)
by: Kitano, S.
Published: (2024)
Toward Lower Bounds for Chromatic Symmetric Functions in the Elementary Basis
by: Siegl, Isaiah
Published: (2025)
by: Siegl, Isaiah
Published: (2025)
New Eigenvalue Bound for the Fractional Chromatic Number
by: Guo, Krystal, et al.
Published: (2022)
by: Guo, Krystal, et al.
Published: (2022)
Lower Bounds for Maximum Weighted Cut
by: Gutin, Gregory, et al.
Published: (2021)
by: Gutin, Gregory, et al.
Published: (2021)
Lower Bounds for Book Ramsey Numbers
by: Wesley, William J.
Published: (2024)
by: Wesley, William J.
Published: (2024)
A Lower Bound for the Max Entropy Algorithm for TSP
by: Jin, Billy, et al.
Published: (2023)
by: Jin, Billy, et al.
Published: (2023)
Spectral upper bounds for the Grundy number of a graph
by: Assis, Thiago, et al.
Published: (2024)
by: Assis, Thiago, et al.
Published: (2024)
Upper Chromatic Numbers: An Update
by: Abrams, Aaron
Published: (2025)
by: Abrams, Aaron
Published: (2025)
An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs
by: Aldi, Marco, et al.
Published: (2025)
by: Aldi, Marco, et al.
Published: (2025)
Improved Lower Bound on the Number of Pseudoline Arrangements
by: Dallant, Justin
Published: (2024)
by: Dallant, Justin
Published: (2024)
The Matching Kneser Graph Conjecture For High Chromatic Numbers
by: Shaebani, Saeed
Published: (2023)
by: Shaebani, Saeed
Published: (2023)
Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut
by: Bakshi, Ainesh, et al.
Published: (2026)
by: Bakshi, Ainesh, et al.
Published: (2026)
Geometrization of Graphs: Towards Bounding the Chromatic Number via High-Dimensional Embedding
by: Fang, Qiming, et al.
Published: (2024)
by: Fang, Qiming, et al.
Published: (2024)
MaxCut in Graphs With Sparse Neighborhoods
by: Jinghua Deng, et al.
Published: (2026)
by: Jinghua Deng, et al.
Published: (2026)
General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)
by: Charvy, Gaspard, et al.
Published: (2025)
Tight Bounds for the Number of Absent Subsequences
by: Adamson, Duncan, et al.
Published: (2024)
by: Adamson, Duncan, et al.
Published: (2024)
The Chromatic Number of Kneser Hypergraphs via Consensus Division
by: Haviv, Ishay
Published: (2023)
by: Haviv, Ishay
Published: (2023)
Chromatic Number of Grassmann Graphs and MRD codes
by: D'haeseleer, Jozefien, et al.
Published: (2026)
by: D'haeseleer, Jozefien, et al.
Published: (2026)
Upper Bounds on the Chromatic Index of Linear Hypergraphs
by: Murff, Thomas, et al.
Published: (2025)
by: Murff, Thomas, et al.
Published: (2025)
Treewidth Inapproximability and Tight ETH Lower Bound
by: Bonnet, Édouard
Published: (2024)
by: Bonnet, Édouard
Published: (2024)
Lower Bounds on Face Numbers of Polytopes with $m$ Facets
by: Hinman, Joshua
Published: (2024)
by: Hinman, Joshua
Published: (2024)
A Tight Lower bound on Trees in Graphs
by: Wilson, Chase
Published: (2025)
by: Wilson, Chase
Published: (2025)
Lower and Upper Bounds for Small Canonical and Ordered Ramsey Numbers
by: Brosch, Daniel, et al.
Published: (2025)
by: Brosch, Daniel, et al.
Published: (2025)
On the Chromatic Number of Stable Kneser Hypergraphs: Verifying the Conjecture for New Families
by: Daneshpajouh, Hamid Reza
Published: (2025)
by: Daneshpajouh, Hamid Reza
Published: (2025)
Quantum Max Cut for complete tripartite graphs
by: Štrekelj, Tea
Published: (2025)
by: Štrekelj, Tea
Published: (2025)
A graph energy conjecture through the lenses of semidefinite programming
by: Abiad, Aida, et al.
Published: (2025)
by: Abiad, Aida, et al.
Published: (2025)
Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs
by: Anto, Nevil, et al.
Published: (2023)
by: Anto, Nevil, et al.
Published: (2023)
The $k^{\text th}$ Upper Chromatic Number of the Line
by: Abrams, Aaron
Published: (2025)
by: Abrams, Aaron
Published: (2025)
Yet Another Species of Forbidden-distances Chromatic Number
by: Abrams, Aaron, et al.
Published: (2025)
by: Abrams, Aaron, et al.
Published: (2025)
Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree
by: Galindo, Rachel, et al.
Published: (2025)
by: Galindo, Rachel, et al.
Published: (2025)
An Improved Lower Bound on the Number of Pseudoline Arrangements
by: Kühnast, Fernando Cortés, et al.
Published: (2024)
by: Kühnast, Fernando Cortés, et al.
Published: (2024)
Similar Items
-
Nearly tight bounds for MaxCut in hypergraphs
by: Janzer, Oliver, et al.
Published: (2025) -
Beyond the MaxCut problem in $H$-free graphs
by: Jin, Zhihan, et al.
Published: (2025) -
Factorization norms and an inverse theorem for MaxCut
by: Balla, Igor, et al.
Published: (2025) -
Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
by: Farhi, Edward, et al.
Published: (2025) -
Asymptotically Tight Bound for the Conflict-Free Chromatic Index
by: Kamyczura, Mateusz, et al.
Published: (2026)