A dichotomy theorem on the complexity of 3-uniform hypergraphic degree sequence graphicality

2024/11/28 by Sara Logsdon, Logsdon, Sara, Maheshwari, Arya +4 · 1 citation
Computer Science · Engineering · #05C07 #05C85 #68Q17 #68Q27 #Advanced Numerical Analysis Techniques #Combinatorics (math.CO) #Digital Image Processing Techniques #FOS: Mathematics #MSC 2020 05C65 #Medical Image Segmentation Techniques

paper · pdf · doi:10.48550/arxiv.2411.19049

openalex publication_date 2024/11/28 · openalex created_date 2024/12/05 · openalex updated_date 2026/07/28

Abstract

We present a dichotomy theorem on the parameterized complexity of the 3-uniform hypergraphicality problem. Given 0

Cited by

• A complete dichotomy theorem on the sparse t-Uniform Hypergraphicality Problem

Related

• A complete dichotomy theorem on the sparse t-Uniform Hypergraphicality Problem
• Dense, irregular, yet always graphic 3-uniform hypergraph degree sequences
• On the Sensitivity Complexity of k-Uniform Hypergraph Properties
• Characterization of the degree sequences of (quasi) regular uniform hypergraphs
• Realizability of hypergraphs and high-dimensional contingency tables with random degrees and marginals