Imagen de Portada

Nearly tight bounds for MaxCut in hypergraphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Janzer, Oliver, Portier, Julien
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Beyond the MaxCut problem in $H$-free graphs
por: Jin, Zhihan, et al.
Publicado: (2025)

Factorization norms and an inverse theorem for MaxCut
por: Balla, Igor, et al.
Publicado: (2025)

Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
por: Farhi, Edward, et al.
Publicado: (2025)

Tightness of a MaxCut Lower Bound via Vector Chromatic Number
por: Juliano, Emanuel
Publicado: (2026)

Tight general bounds for the extremal numbers of 0-1 matrices
por: Janzer, Barnabás, et al.
Publicado: (2024)

Improved bounds for the Erdős-Rogers $(s,s+2)$-problem
por: Janzer, Oliver, et al.
Publicado: (2023)

Tight bounds for intersection-reverse sequences, edge-ordered graphs and applications
por: Janzer, Barnabás, et al.
Publicado: (2024)

Reconstructing a giant component of a point set in $\mathbb{R}$
por: Portier, Julien
Publicado: (2026)

Cliques in minimally globally rigid graphs
por: Portier, Julien
Publicado: (2026)

Ordered Ramsey numbers of powers of paths
por: Girão, António, et al.
Publicado: (2024)

Tight bounds for expected propagation time of probabilistic zero forcing
por: Jelassi, Mehdi, et al.
Publicado: (2025)

Short monochromatic odd cycles
por: Janzer, Oliver, et al.
Publicado: (2025)

Hamiltonicity of regular sublinear expanders
por: Bradač, Domagoj, et al.
Publicado: (2026)

On the Turán number of the hypercube
por: Janzer, Oliver, et al.
Publicado: (2022)

The probability that a random graph is even-decomposable
por: Janzer, Oliver, et al.
Publicado: (2024)

The asymptotic of off-diagonal online Ramsey numbers for paths
por: Mond, Adva, et al.
Publicado: (2023)

Counting tight Hamilton cycles in Dirac hypergraphs
por: Joos, Felix, et al.
Publicado: (2026)

An improved upper bound for the multicolour Ramsey number of odd cycles
por: Axenovich, Maria, et al.
Publicado: (2025)

New bounds on the size of Nearly Perfect Matchings in almost regular hypergraphs
por: Kang, Dong Yeap, et al.
Publicado: (2020)

Induced subgraphs of $K_r$-free graphs and the Erdős--Rogers problem
por: Gishboliner, Lior, et al.
Publicado: (2024)

A Lovász theta lower bound on Quantum Max Cut
por: Huber, Felix
Publicado: (2025)

On the number of minimum dominating sets and total dominating sets in forests
por: Petr, Jan, et al.
Publicado: (2022)

Almost colour-balanced spanning forests in complete graphs
por: Hollom, Lawrence, et al.
Publicado: (2024)

Packing and finding paths in sparse random graphs
por: Iršič, Vesna, et al.
Publicado: (2024)

Nearly tight bound for rainbow clique subdivisions in properly edge-colored graphs and applications
por: Kuang, Peiru, et al.
Publicado: (2026)

Double-jump phase transition for the reverse Littlewood--Offord problem
por: Hollom, Lawrence, et al.
Publicado: (2025)

Independent sets and colorings of $K_{t,t,t}$-free graphs
por: Dhawan, Abhishek, et al.
Publicado: (2025)

Ramsey lower bounds for bounded degree hypergraphs
por: Fan, Chunchao, et al.
Publicado: (2026)

Regular subgraphs at every density
por: Chakraborti, Debsoumya, et al.
Publicado: (2024)

Edge-disjoint cycles with the same vertex set
por: Chakraborti, Debsoumya, et al.
Publicado: (2024)

Power saving for the Brown-Erdős-Sós problem
por: Janzer, Oliver, et al.
Publicado: (2023)

Packing the largest trees in the tree packing conjecture
por: Janzer, Barnabás, et al.
Publicado: (2024)

Lower bounds for Ramsey numbers of bounded degree hypergraphs
por: Bradač, Domagoj, et al.
Publicado: (2025)

Global rigidity of random graphs in $\mathbb{R}$
por: Montgomery, Richard, et al.
Publicado: (2024)

A note on high-dimensional discrepancy of subtrees
por: Hollom, Lawrence, et al.
Publicado: (2024)

Discrepancies of spanning trees in dense graphs
por: Hollom, Lawrence, et al.
Publicado: (2024)

On tight tree-complete hypergraph Ramsey numbers
por: Nie, Jiaxi
Publicado: (2024)

Sharp bounds for rainbow matchings in hypergraphs
por: Pohoata, Cosmin, et al.
Publicado: (2022)

Nearly tight exponents for off-diagonal Ramsey numbers
por: Bradač, Domagoj
Publicado: (2026)

The inertia bound is far from tight
por: Kwan, Matthew, et al.
Publicado: (2023)