Imagen de Portada

Hypergraph Representation via Axis-Aligned Point-Subspace Cover

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Firman, Oksana, Spoerhase, Joachim
Formato:	Preprint
Publicado:	2021
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

Hypergraphs with Polynomial Representation: Introducing $r$-splits
por: Pitois, François, et al.
Publicado: (2022)

On Hypergraph Supports
por: Raman, Rajiv, et al.
Publicado: (2023)

The Phase Transition of Discrepancy in Random Hypergraphs
por: MacRury, Calum, et al.
Publicado: (2021)

On the Modular Chromatic Index of Random Hypergraphs
por: Carenini, Gaia, et al.
Publicado: (2025)

Critical Thresholds for Maximum Cardinality Matching on General Hypergraphs
por: Sumnicht, Christopher, et al.
Publicado: (2024)

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

Representation Number of Word-Representable Split Graphs
por: Dwary, Tithi, et al.
Publicado: (2025)

Boundedness and Separation in the Graph Covering Number Framework
por: Goetze, Miriam, et al.
Publicado: (2025)

Covering Complete Geometric Graphs by Monotone Paths
por: Dumitrescu, Adrian, et al.
Publicado: (2025)

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
por: Mozhui, Khyodeno, et al.
Publicado: (2025)

Word-Representation of Melon Graphs
por: Mozhui, Khyodeno, et al.
Publicado: (2026)

Word-Representability of Shift Graphs
por: Roy, Suchanda, et al.
Publicado: (2026)

On Sets of Monochromatic Objects in Bicolored Point Sets
por: Bhore, Sujoy, et al.
Publicado: (2026)

Characterization of Word-Representable Near-Triangulations
por: Roy, Suchanda, et al.
Publicado: (2026)

On the Conjecture of the Representation Number of Bipartite Graphs
por: Mozhui, Khyodeno, et al.
Publicado: (2025)

On Lexicographic Product and Multi-Word-Representability
por: Kenkireth, Benny George, et al.
Publicado: (2026)

On 3-Connected Planar Graphs with Unique Orientable Circuit Double Covers
por: Weiß, Meike, et al.
Publicado: (2026)

Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
por: Bok, Jan, et al.
Publicado: (2025)

On Patterns and Languages in 1-11-Representations of Graphs
por: Das, Biswajit, et al.
Publicado: (2026)

Characterization of Double-Arborescences and their Minimum-Word-Representants
por: Dwary, Tithi, et al.
Publicado: (2024)

Word-Representability of Well-Partitioned Chordal Graphs
por: Dwary, Tithi, et al.
Publicado: (2025)

On the Word-Representability of 5-Regular Circulant Graphs
por: Roy, Suchanda, et al.
Publicado: (2025)

String Graphs: Product Structure and Localised Representations
por: Karol, Nikolai
Publicado: (2025)

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
por: Dumitrescu, Adrian, et al.
Publicado: (2024)

Characterization of Word-Representable Graphs using Modular Decomposition
por: Dwary, Tithi, et al.
Publicado: (2024)

Representation number of word-representable co-bipartite graph
por: Das, Biswajit, et al.
Publicado: (2025)

Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2025)

Word-Representability of Split Graphs with Independent Set of Size 4
por: Roy, Suchanda, et al.
Publicado: (2025)

Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2025)

Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
por: Lindeberg, Anna, et al.
Publicado: (2024)

Optimal and Efficient Partite Decompositions of Hypergraphs
por: Krapivin, Andrew, et al.
Publicado: (2025)

Computing Height-Optimal Tangles Faster
por: Firman, Oksana, et al.
Publicado: (2019)

The Chromatic Number of Kneser Hypergraphs via Consensus Division
por: Haviv, Ishay
Publicado: (2023)

Fractional coloring via entropy
por: Dhawan, Abhishek
Publicado: (2026)

Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
por: Bartier, Valentin, et al.
Publicado: (2023)

Matroid products via submodular coupling
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Bounds on treewidth via excluding disjoint unions of cycles
por: Hatzel, Meike, et al.
Publicado: (2025)

Efficient counting of permutation patterns via double posets
por: Diehl, Joscha, et al.
Publicado: (2024)

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
por: Firman, Oksana, et al.
Publicado: (2024)

Combinatorial generation via permutation languages. VI. Binary trees
por: Gregor, Petr, et al.
Publicado: (2023)