Imagen de Portada

Holey graphs: very large Betti numbers are testable

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Szabó, Dániel, Apers, Simon
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

A Uniformly Random Solution to Algorithmic Redistricting
por: Cai, Jin-Yi, et al.
Publicado: (2024)

Generating minimal redundant and maximal irredundant sets in incidence graphs
por: Castelo, Emanuel, et al.
Publicado: (2026)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
por: Bencs, Ferenc, et al.
Publicado: (2025)

Perturbation results for distance-edge-monitoring numbers
por: Yang, Chenxu, et al.
Publicado: (2023)

Clique-free t-matchings in degree-bounded graphs
por: Paluch, Katarzyna, et al.
Publicado: (2024)

Interval H-graphs : Recognition and forbidden obstructions
por: Müller, Haiko, et al.
Publicado: (2025)

On the number of $k$-mers admitting a given lexicographical minimizer
por: Ingels, Florian, et al.
Publicado: (2024)

On the Houdré-Tetali conjecture about an isoperimetric constant of graphs
por: Lau, Lap Chi, et al.
Publicado: (2024)

Enumerating minimal solution sets for metric graph problems
por: Bergougnoux, Benjamin, et al.
Publicado: (2023)

Designing sparse temporal graphs satisfying connectivity requirements
por: Bellitto, Thomas, et al.
Publicado: (2026)

Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
por: Ingels, Florian, et al.
Publicado: (2026)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
por: Alecu, Bogdan, et al.
Publicado: (2024)

On the complexity of finding a spanning even tree in a graph
por: Hanaka, Tesshu, et al.
Publicado: (2024)

Quasi-linear distance query reconstruction for graphs of bounded treelength
por: Bastide, Paul, et al.
Publicado: (2024)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
por: Deák, Bence, et al.
Publicado: (2026)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
por: Castelo, Emanuel, et al.
Publicado: (2025)

Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
por: d'Orsi, Tommaso, et al.
Publicado: (2024)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
por: Bonamy, Marthe, et al.
Publicado: (2020)

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
por: Arkhipov, Pavel, et al.
Publicado: (2024)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
por: Ghanbari, Babak, et al.
Publicado: (2025)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
por: Majewski, Konrad, et al.
Publicado: (2022)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
por: Galby, Esther, et al.
Publicado: (2025)

A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
por: Chang, Yeonsu, et al.
Publicado: (2023)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
por: An, Shinwoo, et al.
Publicado: (2025)

Half-space separation in monophonic convexity
por: Elaroussi, Mohammed, et al.
Publicado: (2024)

Translating between the representations of an acyclic convex geometry of bounded degree
por: Defrain, Oscar, et al.
Publicado: (2025)

On the enumeration of signatures of XOR-CNF's
por: Creignou, Nadia, et al.
Publicado: (2024)

Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
por: Neuen, Daniel
Publicado: (2020)

Isomorphism Testing Parameterized by Genus and Beyond
por: Neuen, Daniel
Publicado: (2021)

Robust Contraction Decomposition for Minor-Free Graphs and its Applications
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)

Colouring Probe $H$-Free Graphs
por: Paulusma, Daniël, et al.
Publicado: (2025)

Induced Minors and Coarse Tree Decompositions
por: Chudnovsky, Maria, et al.
Publicado: (2026)

Cycle-factors of regular graphs via entropy
por: Christoph, Micha, et al.
Publicado: (2025)

Tree Independence Number IV. Even-hole-free Graphs
por: Chudnovsky, Maria, et al.
Publicado: (2024)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
por: Jana, Satyabrata, et al.
Publicado: (2025)

Bounding Width on Graph Classes of Constant Diameter
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Reconfiguration of List Colourings
por: Cambie, Stijn, et al.
Publicado: (2025)

Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
por: von Bergen, Hanno, et al.
Publicado: (2026)

Locally seeded embeddings, and Ramsey numbers of bipartite graphs with sublinear bandwidth
por: Altschuler, Dylan J., et al.
Publicado: (2024)