Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Miklós, István, Ruszinkó, Miklós, Zavalnij, Bogdán
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A dichotomy theorem on the complexity of 3-uniform hypergraphic degree sequence graphicality
by: Logsdon, Sara, et al.
Published: (2024)

Proper edge colorings of planar graphs with rainbow $C_4$-s
by: Gyárfás, András, et al.
Published: (2024)

On the Complexity of Bipartite Degree Realizability
by: Miklós, István
Published: (2025)

B-colorings of planar and outerplanar graphs
by: Martin, Ryan R., et al.
Published: (2024)

Improvement on line transversals of families of connected sets in the plane
by: Csizmadia, Miklós
Published: (2025)

Long increasing subsequences and non-algebraicity
by: Bona, Miklos
Published: (2023)

Boolean-Narayana numbers
by: Bona, Miklos
Published: (2026)

Fully graphic degree sequences and P-stable degree sequences
by: Erdős, Péter L., et al.
Published: (2024)

Stack-sorting preimages and 0-1-trees
by: Bona, Miklos
Published: (2025)

On Two Related Questions of Wilf Concerning Standard Young Tableaux
by: Bona, Miklos
Published: (2008)

Large Cuts in Hypergraphs via Energy
by: Räty, Eero, et al.
Published: (2024)

Approximate Sampling of Graphs with Near-$P$-stable Degree Intervals
by: Erdős, Péter L., et al.
Published: (2022)

Connectivity notions on compatible digraphs in equational classes
by: Gyenizse, Gergő, et al.
Published: (2026)

A discrepancy dichotomy for 1-factorizations of signed complete bipartite graphs
by: Xue, Yisai, et al.
Published: (2026)

Counting pairs of cycles whose product is a permutation with restricted cycle lengths
by: Bona, Miklos, et al.
Published: (2024)

Bisection Width, Discrepancy, and Eigenvalues of Hypergraphs
by: Räty, Eero, et al.
Published: (2024)

Solution of Erdős Problem 633
by: Beeson, Michael, et al.
Published: (2026)

The Uniform Random Walk on graphs, loop processes and graphings
by: Abert, Miklos, et al.
Published: (2025)

Boolean--Eulerian numbers
by: Bóna, Miklós, et al.
Published: (2026)

Hypergraph anti-Ramsey theorems
by: Liu, Xizhi, et al.
Published: (2023)

On the Estrada Index and Spectral Properties of $k$-Uniform Hypergraphs
by: Kurian, Liya Jess, et al.
Published: (2025)

On the Transversal Coalition in r-Uniform Hypergraphs
by: Shinde, Vrushali, et al.
Published: (2026)

On the intersection of pairs of trees
by: Bona, Miklos, et al.
Published: (2025)

The likely maximum size of twin subtrees in a large random tree
by: Bona, Miklos, et al.
Published: (2023)

Anti-Ramsey Numbers of Expansions of Doubly Edge-critical Graphs in Uniform Hypergraphs
by: Li, Tong, et al.
Published: (2024)

On the Random Minimum Spanning Subgraph Problem for Hypergraphs
by: Zvonkov, Nikita
Published: (2024)

Hypergraph Turán Problems in $\ell_2$-Norm
by: Balogh, József, et al.
Published: (2021)

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

The filter of interpretability types of Hobby-McKenzie varieties is prime
by: Bodor, Bertalan, et al.
Published: (2024)

Taylor is prime
by: Bodor, Bertalan, et al.
Published: (2023)

A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms
by: Marino, Raffaele, et al.
Published: (2024)

Discrete and Continuous Caching Games
by: Jánosik, Áron, et al.
Published: (2023)

Hardness of Hypergraph Edge Modification Problems
by: Gishboliner, Lior, et al.
Published: (2025)

A universal dichotomy for concentration in randomly colored graphs
by: Apollonio, Nicola
Published: (2026)

Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
by: Arras, Patrick, et al.
Published: (2024)

#P-hardness proofs of matrix immanants evaluated on restricted matrices
by: Miklos, Istvan, et al.
Published: (2021)

An almost complete $t$-intersection theorem for permutations
by: Kupavskii, Andrey
Published: (2024)

A central limit theorem for the matching number of a sparse random graph
by: Glasgow, Margalit, et al.
Published: (2024)

The Quantitative Fractional Helly theorem
by: Frankl, Nóra, et al.
Published: (2024)

Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphs
by: Apollonio, Nicola
Published: (2024)