:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Garamvölgyi, Dániel, Jordán, Tibor, Király, Csaba, Villányi, Soma
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2401.12670
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Count and cofactor matroids of highly connected graphs
by: Garamvölgyi, Dániel, et al.
Published: (2022)

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

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

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

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

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

Degree Sum Conditions for Graph Rigidity
by: Jordán, Tibor, et al.
Published: (2025)

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

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

Spectral radius and edge-disjoint connected factors of graphs
by: Tang, Xinying, et al.
Published: (2026)

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

Color-avoiding connected spanning subgraphs with minimum number of edges
by: Pintér, József, et al.
Published: (2023)

On generic universal rigidity on the line
by: Moura, Guilherme Zeus Dantas e, et al.
Published: (2023)

Minimally rigid tensegrity frameworks
by: Clay, Adam D. W., et al.
Published: (2024)

Packing edge disjoint cliques in graphs
by: Balogh, József, et al.
Published: (2025)

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
by: Krone, Maximilian
Published: (2025)

Antidirected subgraphs of oriented graphs
by: Stein, Maya, et al.
Published: (2022)

Unavoidable induced subgraphs of large and infinite $2$-edge-connected graphs
by: Allred, Sarah, et al.
Published: (2025)

On the random minimum edge-disjoint spanning trees problem
by: Shabanov, Dmitry, et al.
Published: (2025)

Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs
by: Gao, Yongbin, et al.
Published: (2026)

Eigenvalues, edge-disjoint perfect matchings and toughness of regular graphs
by: Zhang, Wenqian
Published: (2024)

Note on vertex disjoint rainbow triangles in edge-colored graphs
by: Kritschgau, Jürgen, et al.
Published: (2024)

Constructing edge-disjoint Steiner trees in Cartesian product networks
by: Li, Rui, et al.
Published: (2023)

Two-edge-connected (not necessarily spanning) subgraphs and polyhedra
by: Bruckamp, Justus, et al.
Published: (2024)

Spanning tree-connected subgraphs with small degrees
by: Hasanvand, Morteza
Published: (2022)

Minimum degree and sparse connected spanning subgraphs
by: Huang, Ting, et al.
Published: (2025)

Edge-connectivity and pairwise disjoint perfect matchings in regular graphs
by: Ma, Yulai, et al.
Published: (2022)

Highly connected graphs have highly connected spanning bipartite subgraphs
by: Yuster, Raphael
Published: (2024)

Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)

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

Eigenvalue conditions implying edge-disjoint spanning trees and a forest with constraints
by: Cai, Jin, et al.
Published: (2025)

More Ramsey theory for highly connected monochromatic subgraphs
by: Hrušák, Michael, et al.
Published: (2023)

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

Signless Laplacian characterization of cones over disjoint unions of cycles, edges and isolated vertices
by: Ye, Jiachang, et al.
Published: (2025)

On connected subgraph arrangements
by: Giordani, Lorenzo, et al.
Published: (2025)

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

On the number of small edge-weighted subgraphs
by: Yu, Feng, et al.
Published: (2025)

Laplacian eigenvalue conditions for edge-disjoint spanning trees and a forest with constraints
by: Gao, Yongbin, et al.
Published: (2026)

Characterizing forbidden pairs for spanning $\varTheta$-subgraphs of 2-connected graphs
by: Li, Binlong, et al.
Published: (2025)

Free multiderivations of connected subgraph arrangements
by: Mücksch, Paul, et al.
Published: (2024)