Imagen de Portada

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Dhawan, Abhishek, Dinh, Nhi U., Kızıldağ, Eren C., Maitra, Neeladri, Şahin, Bayram A.
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Computational Complexity Discrete Mathematics Combinatorics Probability
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Sharp Online Hardness for Large Balanced Independent Sets
por: Dhawan, Abhishek, et al.
Publicado: (2025)

The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
por: Dhawan, Abhishek, et al.
Publicado: (2024)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
por: Gamarnik, David, et al.
Publicado: (2026)

Optimal Hardness of Online Algorithms for Large Independent Sets
por: Gamarnik, David, et al.
Publicado: (2025)

Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers
por: R., Abhishek Hegade K., et al.
Publicado: (2025)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
por: Hellmuth, Marc, et al.
Publicado: (2023)

Sharp Thresholds for the Overlap Gap Property: Ising $p$-Spin Glass and Random $k$-SAT
por: Kızıldağ, Eren C.
Publicado: (2023)

Palette Sparsification for Graphs with Sparse Neighborhoods
por: Dhawan, Abhishek
Publicado: (2024)

(Independent) Roman Domination Parameterized by Distance to Cluster
por: Ashok, Pradeesha, et al.
Publicado: (2024)

Exact Algorithms for Edge Deletion to Cactus
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2026)

Space Efficient Algorithms for Parameterised Problems
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2025)

A Fixed-Parameter Algorithm for the Kneser Problem
por: Haviv, Ishay
Publicado: (2022)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
por: Bernshteyn, Anton, et al.
Publicado: (2024)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
por: Foucaud, Florent, et al.
Publicado: (2024)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
por: Bansal, Nikhil, et al.
Publicado: (2025)

Stable Approximation Algorithms for Dominating Set and Independent Set
por: de Berg, Mark, et al.
Publicado: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
por: Kunisky, Dmitriy, et al.
Publicado: (2023)

Parameter estimation for Gibbs distributions
por: Harris, David G., et al.
Publicado: (2020)

Graph Search Trees and the Intermezzo Problem
por: Beisegel, Jesse, et al.
Publicado: (2024)

Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier
por: Hsieh, Jun-Ting, et al.
Publicado: (2024)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
por: Beisegel, Jesse, et al.
Publicado: (2025)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
por: Scheffler, Robert
Publicado: (2025)

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
por: Bedert, Benjamin, et al.
Publicado: (2025)

Explicit Almost-Optimal $\varepsilon$-Balanced Codes via Free Expander Walks
por: Hsieh, Jun-Ting, et al.
Publicado: (2026)

Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
por: Mary, Arnaud
Publicado: (2024)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
por: Eagling-Vose, Tala, et al.
Publicado: (2025)

An unconditional lower bound for the active-set method on the hypercube
por: Disser, Yann, et al.
Publicado: (2025)

Solving Problems on Generalized Convex Graphs via Mim-Width
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2020)

An unconditional lower bound for the active-set method in convex quadratic maximization
por: Bach, Eleon, et al.
Publicado: (2025)

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
por: Cordasco, Gennaro, et al.
Publicado: (2024)

Computing Hamiltonian Paths with Partial Order Restrictions
por: Beisegel, Jesse, et al.
Publicado: (2024)

The tape reconfiguration problem and its consequences for dominating set reconfiguration
por: Bousquet, Nicolas, et al.
Publicado: (2025)

An efficient uniqueness theorem for overcomplete tensor decomposition
por: Koiran, Pascal
Publicado: (2024)

Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
por: Ahn, Jungho, et al.
Publicado: (2026)

Computing Subset Vertex Covers in $H$-Free Graphs
por: Brettell, Nick, et al.
Publicado: (2023)

Finding $d$-Cuts in Probe $H$-Free Graphs
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Graph Classes Closed under Self-intersection
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

On graphs coverable by k shortest paths
por: Dumas, Maël, et al.
Publicado: (2022)

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
por: Le, Hoang-Oanh, et al.
Publicado: (2024)

Steiner Forest for $H$-Subgraph-Free Graphs
por: Eagling-Vose, Tala, et al.
Publicado: (2026)