Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Miklós, István, Ruszinkó, Miklós, Zavalnij, Bogdán
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

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

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

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

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

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

Long increasing subsequences and non-algebraicity
por: Bona, Miklos
Publicado: (2023)

Boolean-Narayana numbers
por: Bona, Miklos
Publicado: (2026)

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

Stack-sorting preimages and 0-1-trees
por: Bona, Miklos
Publicado: (2025)

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

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

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

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

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

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

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

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

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

Hypergraph anti-Ramsey theorems
por: Liu, Xizhi, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

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

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

Taylor is prime
por: Bodor, Bertalan, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

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

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