Imagen de Portada

Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Garamvölgyi, Dániel, Jackson, Bill, Jordán, Tibor, Villányi, Soma
Formato:	Preprint
Publicado:	2025
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)

Globally linked pairs and cheapest globally rigid supergraphs
por: Jordán, Tibor, et al.
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)

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

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

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

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

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

Sufficient conditions for $t$-tough graphs to be Hamiltonian and pancyclic or bipartite
por: Liu, Xiangge, et al.
Publicado: (2025)

The stability of independence polynomials of complete bipartite graphs
por: Chen, Guo, et al.
Publicado: (2025)

The distinguishing number of complete bipartite and crown graphs
por: Chen, Lei, et al.
Publicado: (2026)

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

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

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

Weak saturation numbers of large complete bipartite graphs
por: Akhmejanova, Margarita, et al.
Publicado: (2025)

Nonorientable genus embedding of nearly complete bipartite graphs
por: Lv, Shengxiang
Publicado: (2023)

A note on the lacking polynomial of the complete bipartite graph
por: Alofi, Amal, et al.
Publicado: (2024)

Unavoidable patterns in $2$-colorings of the complete bipartite graph
por: Hansberg, Adriana, et al.
Publicado: (2024)

Almost-perfect colorful matchings in three-edge-colored bipartite graphs
por: Boyadzhiyska, Simona, et al.
Publicado: (2025)

Turán number of complete bipartite graphs with bounded matching number
por: Luo, Huan, et al.
Publicado: (2024)

Rigidity of Graphs and Frameworks: A Matroid Theoretic Approach
por: Cruickshank, James, et al.
Publicado: (2025)

Separating path systems for cubic graphs and for complete bipartite graphs
por: Fernandes, Cristina, et al.
Publicado: (2025)

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

A discrepancy dichotomy for 1-factorizations of signed complete bipartite graphs
por: Xue, Yisai, et al.
Publicado: (2026)

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

Stiffness matrices of graph blow-ups and the $d$-dimensional algebraic connectivity of complete bipartite graphs
por: Jung, Yunseong, et al.
Publicado: (2025)

A simple proof of the existence of complete bipartite graph immersion in graphs with independence number two
por: Chen, Rong, et al.
Publicado: (2024)

Sufficient conditions for spanning $k$-trees in tough graphs
por: Jia, Caili, et al.
Publicado: (2026)

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

A spectral condition for Hamilton cycles in tough bipartite graphs
por: Ai, Lianyang, et al.
Publicado: (2025)

Combinatorial sufficient conditions for graph rigidity and applications to random graphs
por: Krivelevich, Michael, et al.
Publicado: (2026)

Induced saturation for complete bipartite posets
por: Liu, Dingyuan
Publicado: (2024)

Connectivity keeping trees in 3-connected bipartite graphs with girth conditions
por: Yang, Qing, et al.
Publicado: (2023)

Turán number of the odd-ballooning of complete bipartite graphs
por: Peng, Xing, et al.
Publicado: (2023)

Non-bipartite k-common graphs
por: Kral, Daniel, et al.
Publicado: (2020)

Sufficient conditions for even factors in graphs
por: Zhou, Sizhong, et al.
Publicado: (2025)

Odd complete bipartite minors in graphs with independence number two
por: Chen, Rong, et al.
Publicado: (2025)

$k$-fold circuits and coning in rigidity matroids
por: Hewetson, John, et al.
Publicado: (2025)

On bipartite biregular large graphs
por: Araujo-Pardo, G., et al.
Publicado: (2024)