On generic 3-rigidity of graphs
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914286870200320 |
|---|---|
| author | Baranyai, Tamás |
| author_facet | Baranyai, Tamás |
| contents | We give a necessary condition of generic 3 -rigidity of graphs relying on partitioning the edges into 3 subsets; such that each subset-pair gives a generically 2-rigid graph, either by themselves or after an appropriate edge-deletion. Notably, as pointed out by Dewar and Gallet, the condition is still not sufficient. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_16741 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On generic 3-rigidity of graphs Baranyai, Tamás Combinatorics We give a necessary condition of generic 3 -rigidity of graphs relying on partitioning the edges into 3 subsets; such that each subset-pair gives a generically 2-rigid graph, either by themselves or after an appropriate edge-deletion. Notably, as pointed out by Dewar and Gallet, the condition is still not sufficient. |
| title | On generic 3-rigidity of graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2409.16741 |