Imagen de Portada

The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Martínez-Sandoval, Leonardo, Padrol, Arnau
Formato:	Preprint
Publicado:	2019
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
por: Meunier, Anthony, et al.
Publicado: (2026)

Hamiltonian connectivity of some base-cobase graphs
por: Martínez-Sandoval, Leonardo, et al.
Publicado: (2025)

Three-chromatic geometric hypergraphs
por: Damásdi, Gábor, et al.
Publicado: (2021)

On arborescence packing augmentation in hypergraphs
por: Hoppenot, Pierre, et al.
Publicado: (2024)

The chromatic number of triangle-free hypergraphs
por: Li, Lina, et al.
Publicado: (2022)

Balanced colorings of Erdős-Rényi hypergraphs
por: Dhawan, Abhishek, et al.
Publicado: (2025)

Balanced independent sets and colorings of hypergraphs
por: Dhawan, Abhishek
Publicado: (2023)

A note on hypergraphs with asymmetric Ramsey properties
por: Sviridenkov, Vladimir
Publicado: (2026)

Chemically inspired Erdős-Rényi oriented hypergraphs
por: Garcia-Chung, Angel, et al.
Publicado: (2023)

The Avoider-Enforcer game on hypergraphs of rank 3
por: Galliot, Florian, et al.
Publicado: (2025)

An asymptotic rigidity property from the realizability of chirotope extensions
por: Goaoc, Xavier, et al.
Publicado: (2025)

Regular packing of rooted hyperforests with root constraints in hypergraphs
por: Hoppenot, Pierre, et al.
Publicado: (2023)

Note on polychromatic coloring of hereditary hypergraph families II
por: Pálvölgyi, Dömötör
Publicado: (2026)

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
por: Galliot, Florian, et al.
Publicado: (2022)

Halfspace separation in geodesic convexity
por: Nair, Niranjan
Publicado: (2026)

On weighted partial triangulations of convex polygons
por: Blanca, Antonio, et al.
Publicado: (2026)

M-convexity of the minimum-cost packings of arborescences
por: Takazawa, Kenjiro
Publicado: (2018)

The Dominating 4-Colour Theorem
por: Girão, António, et al.
Publicado: (2026)

A multidimensional Ramsey Theorem
por: Girão, António, et al.
Publicado: (2022)

The Excluded Tree Minor Theorem Revisited
por: Dujmović, Vida, et al.
Publicado: (2023)

Vertex-Based Localization of Turán's Theorem
por: Adak, Rajat, et al.
Publicado: (2025)

Polynomial Bounds in the Apex Minor Theorem
por: Hendrey, Kevin, et al.
Publicado: (2025)

On the Extension Theorem for Packing Steiner Forests
por: Zeng, Jinghan A
Publicado: (2026)

Menger's Theorem for Temporal Paths (Not Walks)
por: Ibiapina, Allen, et al.
Publicado: (2022)

A multipartite analogue of Dilworth's Theorem
por: Fox, Jacob, et al.
Publicado: (2024)

Cliquewidth and dimension
por: Joret, Gwenaël, et al.
Publicado: (2023)

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
por: Hoppenot, Pierre, et al.
Publicado: (2024)

Treewidth 2 in the Planar Graph Product Structure Theorem
por: Distel, Marc, et al.
Publicado: (2024)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
por: Adak, Rajat, et al.
Publicado: (2025)

A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs
por: Zhang, Jiechen
Publicado: (2026)

Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
por: Ai, Jiangdong, et al.
Publicado: (2025)

Throttling for metric dimension and its variants
por: Brimkov, Boris, et al.
Publicado: (2025)

Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
por: Hatzel, Meike, et al.
Publicado: (2026)

Fault tolerance for metric dimension and its variants
por: Geneson, Jesse, et al.
Publicado: (2025)

Coboundary and cosystolic expansion without dependence on dimension or degree
por: Dikstein, Yotam, et al.
Publicado: (2023)

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

Counting simplicial pairs in hypergraphs
por: Barrett, Jordan, et al.
Publicado: (2024)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
por: Nakajima, Tamio-Vesa, et al.
Publicado: (2025)

A characterization of testable hypergraph properties
por: Joos, Felix, et al.
Publicado: (2017)

Improved bounds for coloring locally sparse hypergraphs
por: Iliopoulos, Fotis
Publicado: (2020)