Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Miklós, István, Ruszinkó, Miklós, Zavalnij, Bogdán
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A dichotomy theorem on the complexity of 3-uniform hypergraphic degree sequence graphicality
par: Logsdon, Sara, et autres
Publié: (2024)

Proper edge colorings of planar graphs with rainbow $C_4$-s
par: Gyárfás, András, et autres
Publié: (2024)

On the Complexity of Bipartite Degree Realizability
par: Miklós, István
Publié: (2025)

B-colorings of planar and outerplanar graphs
par: Martin, Ryan R., et autres
Publié: (2024)

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

Long increasing subsequences and non-algebraicity
par: Bona, Miklos
Publié: (2023)

Boolean-Narayana numbers
par: Bona, Miklos
Publié: (2026)

Fully graphic degree sequences and P-stable degree sequences
par: Erdős, Péter L., et autres
Publié: (2024)

Stack-sorting preimages and 0-1-trees
par: Bona, Miklos
Publié: (2025)

On Two Related Questions of Wilf Concerning Standard Young Tableaux
par: Bona, Miklos
Publié: (2008)

Large Cuts in Hypergraphs via Energy
par: Räty, Eero, et autres
Publié: (2024)

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

Connectivity notions on compatible digraphs in equational classes
par: Gyenizse, Gergő, et autres
Publié: (2026)

A discrepancy dichotomy for 1-factorizations of signed complete bipartite graphs
par: Xue, Yisai, et autres
Publié: (2026)

Counting pairs of cycles whose product is a permutation with restricted cycle lengths
par: Bona, Miklos, et autres
Publié: (2024)

Bisection Width, Discrepancy, and Eigenvalues of Hypergraphs
par: Räty, Eero, et autres
Publié: (2024)

Solution of Erdős Problem 633
par: Beeson, Michael, et autres
Publié: (2026)

The Uniform Random Walk on graphs, loop processes and graphings
par: Abert, Miklos, et autres
Publié: (2025)

Boolean--Eulerian numbers
par: Bóna, Miklós, et autres
Publié: (2026)

Hypergraph anti-Ramsey theorems
par: Liu, Xizhi, et autres
Publié: (2023)

On the Estrada Index and Spectral Properties of $k$-Uniform Hypergraphs
par: Kurian, Liya Jess, et autres
Publié: (2025)

On the Transversal Coalition in r-Uniform Hypergraphs
par: Shinde, Vrushali, et autres
Publié: (2026)

On the intersection of pairs of trees
par: Bona, Miklos, et autres
Publié: (2025)

The likely maximum size of twin subtrees in a large random tree
par: Bona, Miklos, et autres
Publié: (2023)

Anti-Ramsey Numbers of Expansions of Doubly Edge-critical Graphs in Uniform Hypergraphs
par: Li, Tong, et autres
Publié: (2024)

On the Random Minimum Spanning Subgraph Problem for Hypergraphs
par: Zvonkov, Nikita
Publié: (2024)

Hypergraph Turán Problems in $\ell_2$-Norm
par: Balogh, József, et autres
Publié: (2021)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
par: Gamarnik, David, et autres
Publié: (2026)

The filter of interpretability types of Hobby-McKenzie varieties is prime
par: Bodor, Bertalan, et autres
Publié: (2024)

Taylor is prime
par: Bodor, Bertalan, et autres
Publié: (2023)

A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms
par: Marino, Raffaele, et autres
Publié: (2024)

Discrete and Continuous Caching Games
par: Jánosik, Áron, et autres
Publié: (2023)

Hardness of Hypergraph Edge Modification Problems
par: Gishboliner, Lior, et autres
Publié: (2025)

A universal dichotomy for concentration in randomly colored graphs
par: Apollonio, Nicola
Publié: (2026)

Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
par: Arras, Patrick, et autres
Publié: (2024)

#P-hardness proofs of matrix immanants evaluated on restricted matrices
par: Miklos, Istvan, et autres
Publié: (2021)

An almost complete $t$-intersection theorem for permutations
par: Kupavskii, Andrey
Publié: (2024)

A central limit theorem for the matching number of a sparse random graph
par: Glasgow, Margalit, et autres
Publié: (2024)

The Quantitative Fractional Helly theorem
par: Frankl, Nóra, et autres
Publié: (2024)

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