Saved in:
| Main Authors: | Janzer, Oliver, Portier, Julien |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.08501 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
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)
Tight general bounds for the extremal numbers of 0-1 matrices
by: Janzer, Barnabás, et al.
Published: (2024)
by: Janzer, Barnabás, et al.
Published: (2024)
Tightness of a MaxCut Lower Bound via Vector Chromatic Number
by: Juliano, Emanuel
Published: (2026)
by: Juliano, Emanuel
Published: (2026)
Tight bounds for intersection-reverse sequences, edge-ordered graphs and applications
by: Janzer, Barnabás, et al.
Published: (2024)
by: Janzer, Barnabás, et al.
Published: (2024)
Improved bounds for the Erdős-Rogers $(s,s+2)$-problem
by: Janzer, Oliver, et al.
Published: (2023)
by: Janzer, Oliver, et al.
Published: (2023)
Reconstructing a giant component of a point set in $\mathbb{R}$
by: Portier, Julien
Published: (2026)
by: Portier, Julien
Published: (2026)
Cliques in minimally globally rigid graphs
by: Portier, Julien
Published: (2026)
by: Portier, Julien
Published: (2026)
Ordered Ramsey numbers of powers of paths
by: Girão, António, et al.
Published: (2024)
by: Girão, António, et al.
Published: (2024)
Tight bounds for expected propagation time of probabilistic zero forcing
by: Jelassi, Mehdi, et al.
Published: (2025)
by: Jelassi, Mehdi, et al.
Published: (2025)
Short monochromatic odd cycles
by: Janzer, Oliver, et al.
Published: (2025)
by: Janzer, Oliver, et al.
Published: (2025)
Hamiltonicity of regular sublinear expanders
by: Bradač, Domagoj, et al.
Published: (2026)
by: Bradač, Domagoj, et al.
Published: (2026)
On the Turán number of the hypercube
by: Janzer, Oliver, et al.
Published: (2022)
by: Janzer, Oliver, et al.
Published: (2022)
The probability that a random graph is even-decomposable
by: Janzer, Oliver, et al.
Published: (2024)
by: Janzer, Oliver, et al.
Published: (2024)
The asymptotic of off-diagonal online Ramsey numbers for paths
by: Mond, Adva, et al.
Published: (2023)
by: Mond, Adva, et al.
Published: (2023)
Counting tight Hamilton cycles in Dirac hypergraphs
by: Joos, Felix, et al.
Published: (2026)
by: Joos, Felix, et al.
Published: (2026)
An improved upper bound for the multicolour Ramsey number of odd cycles
by: Axenovich, Maria, et al.
Published: (2025)
by: Axenovich, Maria, et al.
Published: (2025)
Induced subgraphs of $K_r$-free graphs and the Erdős--Rogers problem
by: Gishboliner, Lior, et al.
Published: (2024)
by: Gishboliner, Lior, et al.
Published: (2024)
On the number of minimum dominating sets and total dominating sets in forests
by: Petr, Jan, et al.
Published: (2022)
by: Petr, Jan, et al.
Published: (2022)
Almost colour-balanced spanning forests in complete graphs
by: Hollom, Lawrence, et al.
Published: (2024)
by: Hollom, Lawrence, et al.
Published: (2024)
Packing and finding paths in sparse random graphs
by: Iršič, Vesna, et al.
Published: (2024)
by: Iršič, Vesna, et al.
Published: (2024)
A Lovász theta lower bound on Quantum Max Cut
by: Huber, Felix
Published: (2025)
by: Huber, Felix
Published: (2025)
Double-jump phase transition for the reverse Littlewood--Offord problem
by: Hollom, Lawrence, et al.
Published: (2025)
by: Hollom, Lawrence, et al.
Published: (2025)
New bounds on the size of Nearly Perfect Matchings in almost regular hypergraphs
by: Kang, Dong Yeap, et al.
Published: (2020)
by: Kang, Dong Yeap, et al.
Published: (2020)
Independent sets and colorings of $K_{t,t,t}$-free graphs
by: Dhawan, Abhishek, et al.
Published: (2025)
by: Dhawan, Abhishek, et al.
Published: (2025)
Nearly tight bound for rainbow clique subdivisions in properly edge-colored graphs and applications
by: Kuang, Peiru, et al.
Published: (2026)
by: Kuang, Peiru, et al.
Published: (2026)
Regular subgraphs at every density
by: Chakraborti, Debsoumya, et al.
Published: (2024)
by: Chakraborti, Debsoumya, et al.
Published: (2024)
Edge-disjoint cycles with the same vertex set
by: Chakraborti, Debsoumya, et al.
Published: (2024)
by: Chakraborti, Debsoumya, et al.
Published: (2024)
Power saving for the Brown-Erdős-Sós problem
by: Janzer, Oliver, et al.
Published: (2023)
by: Janzer, Oliver, et al.
Published: (2023)
Packing the largest trees in the tree packing conjecture
by: Janzer, Barnabás, et al.
Published: (2024)
by: Janzer, Barnabás, et al.
Published: (2024)
Global rigidity of random graphs in $\mathbb{R}$
by: Montgomery, Richard, et al.
Published: (2024)
by: Montgomery, Richard, et al.
Published: (2024)
A note on high-dimensional discrepancy of subtrees
by: Hollom, Lawrence, et al.
Published: (2024)
by: Hollom, Lawrence, et al.
Published: (2024)
Discrepancies of spanning trees in dense graphs
by: Hollom, Lawrence, et al.
Published: (2024)
by: Hollom, Lawrence, et al.
Published: (2024)
On tight tree-complete hypergraph Ramsey numbers
by: Nie, Jiaxi
Published: (2024)
by: Nie, Jiaxi
Published: (2024)
Ramsey lower bounds for bounded degree hypergraphs
by: Fan, Chunchao, et al.
Published: (2026)
by: Fan, Chunchao, et al.
Published: (2026)
Lower bounds for Ramsey numbers of bounded degree hypergraphs
by: Bradač, Domagoj, et al.
Published: (2025)
by: Bradač, Domagoj, et al.
Published: (2025)
MaxCut in Graphs With Sparse Neighborhoods
by: Jinghua Deng, et al.
Published: (2026)
by: Jinghua Deng, et al.
Published: (2026)
Sharp bounds for rainbow matchings in hypergraphs
by: Pohoata, Cosmin, et al.
Published: (2022)
by: Pohoata, Cosmin, et al.
Published: (2022)
The inertia bound is far from tight
by: Kwan, Matthew, et al.
Published: (2023)
by: Kwan, Matthew, et al.
Published: (2023)
Similar Items
-
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) -
Tight general bounds for the extremal numbers of 0-1 matrices
by: Janzer, Barnabás, et al.
Published: (2024) -
Tightness of a MaxCut Lower Bound via Vector Chromatic Number
by: Juliano, Emanuel
Published: (2026)