Imagen de Portada

Count and cofactor matroids of highly connected graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Garamvölgyi, Dániel, Jordán, Tibor, Király, Csaba
Formato:	Preprint
Publicado:	2022
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Highly connected orientations from edge-disjoint rigid subgraphs
por: Garamvölgyi, Dániel, et al.
Publicado: (2024)

Rigidity and reconstruction in matroids of highly connected graphs
por: Garamvölgyi, Dániel
Publicado: (2024)

Minimally globally rigid graphs
por: Garamvölgyi, Dániel, et al.
Publicado: (2022)

Partial reflections and globally linked pairs in rigid graphs
por: Garamvölgyi, Dániel, et al.
Publicado: (2023)

Globally rigid graphs are fully reconstructible
por: Garamvölgyi, Dániel, et al.
Publicado: (2021)

Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs
por: Garamvölgyi, Dániel, et al.
Publicado: (2025)

Stress-linked pairs of vertices and the generic stress matroid
por: Garamvölgyi, Dániel
Publicado: (2023)

Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory
por: Garamvölgyi, Dániel, et al.
Publicado: (2025)

Detachable pairs in $3$-connected matroids and simple $3$-connected graphs
por: Brettell, Nick, et al.
Publicado: (2024)

Characterizing globally linked pairs in graphs
por: Jordán, Tibor, et al.
Publicado: (2026)

Chordal matroids arising from generalized parallel connections
por: Douthitt, James Dylan, et al.
Publicado: (2023)

Globally linked pairs and cheapest globally rigid supergraphs
por: Jordán, Tibor, et al.
Publicado: (2024)

Decomposition of degree-regular graphs into quasi-random pairs without the Regularity lemma
por: Csaba, Béla
Publicado: (2026)

Super-minimally $3$-connected matroids
por: Ge, Wayne, et al.
Publicado: (2026)

What is a 4-connected matroid?
por: Brettell, Nick, et al.
Publicado: (2023)

Evolution of random representable matroids: minors, circuits, connectivity and the critical number
por: Gao, Pu, et al.
Publicado: (2024)

Towards the Proximity Conjecture on Group-Labeled Matroids
por: Garamvölgyi, Dániel, et al.
Publicado: (2024)

Counting multiple graphs in generalized Turán problems
por: Gerbner, Dániel
Publicado: (2020)

Stable cuts, NAC-colourings and flexible realisations of graphs
por: Clinch, Katie, et al.
Publicado: (2024)

Characteristic polynomials of semimatroids and their connections to matroids, hyperplane arrangements and graph colorings
por: Fu, Houshan
Publicado: (2025)

On almost Gallai colourings in complete graphs
por: Grebennikov, Alexandr, et al.
Publicado: (2025)

Intersections of longest cycles in vertex-transitive and highly connected graphs
por: Ma, Jie, et al.
Publicado: (2025)

Equitable factorizations of highly edge-connected graphs: complete characterizations
por: Hasanvand, Morteza
Publicado: (2024)

Slow graph bootstrap percolation I: Cycles
por: Fabian, David, et al.
Publicado: (2023)

Uniform density in matroids, matrices and graphs
por: Devriendt, Karel, et al.
Publicado: (2023)

Slow graph bootstrap percolation II: Accelerating properties
por: Fabian, David, et al.
Publicado: (2023)

Slow graph bootstrap percolation III: Chain constructions
por: Fabian, David, et al.
Publicado: (2025)

Global rigidity of random graphs in $\mathbb{R}$
por: Montgomery, Richard, et al.
Publicado: (2024)

Counting triangles in regular graphs
por: He, Jialin, et al.
Publicado: (2023)

Odd and Even Harder Problems on Cycle-Factors
por: Hörsch, Florian, et al.
Publicado: (2025)

On the foundations of signed graphs I: chain groups, frame matroid, and bivariate flow polynomial
por: Chen, Beifang
Publicado: (2025)

Improved bounds for the minimum degree of minimal multicolor Ramsey graphs
por: Attwa, Yamaan, et al.
Publicado: (2025)

The foundation of generalized parallel connections, 2-sums, and segment-cosegment exchanges of matroids
por: Baker, Matthew, et al.
Publicado: (2024)

Monochromatic $k$-connection of graphs
por: Cai, Qingqiong, et al.
Publicado: (2024)

The Jacobian of a regular orthogonal matroid and torsor structures on spanning quasi-trees of ribbon graphs
por: Baker, Matthew, et al.
Publicado: (2025)

The polytope of all matroids
por: Ferroni, Luis, et al.
Publicado: (2025)

On plane rigidity matroids
por: Tyomkyn, Mykhaylo
Publicado: (2026)

Counting subgraphs in locally dense graphs
por: Bradač, Domagoj, et al.
Publicado: (2024)

Counting independent sets in structured graphs
por: Bucić, Matija, et al.
Publicado: (2024)

4-connected 1-planar chordal graphs are Hamiltonian-connected
por: Zhang, Licheng, et al.
Publicado: (2024)