Non-recursively constructible recursive families of graphs (Q426873): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Colleen M. Bouey / rank | |||
| Property / author | |||
| Property / author: Colleen M. Bouey / rank | |||
Normal rank | |||
| Property / review text | |||
Summary: In a publication by \textit{M. Noy} and \textit{A. Ribó} [Adv. Appl. Math. 32, No. 1--2, 350--363 (2004; Zbl 1041.05050)], it was shown that recursively constructible families of graphs are recursive. The authors also conjecture that the converse holds; that is, recursive families are also recursively constructible. In this paper, we provide two specific counterexamples to this conjecture, which we then extend to an infinite family of counterexamples. | |||
| Property / review text: Summary: In a publication by \textit{M. Noy} and \textit{A. Ribó} [Adv. Appl. Math. 32, No. 1--2, 350--363 (2004; Zbl 1041.05050)], it was shown that recursively constructible families of graphs are recursive. The authors also conjecture that the converse holds; that is, recursive families are also recursively constructible. In this paper, we provide two specific counterexamples to this conjecture, which we then extend to an infinite family of counterexamples. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C31 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C75 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6045702 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Tutte polynomial | |||
| Property / zbMATH Keywords: Tutte polynomial / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:14, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-recursively constructible recursive families of graphs |
scientific article |
Statements
Non-recursively constructible recursive families of graphs (English)
0 references
12 June 2012
0 references
Summary: In a publication by \textit{M. Noy} and \textit{A. Ribó} [Adv. Appl. Math. 32, No. 1--2, 350--363 (2004; Zbl 1041.05050)], it was shown that recursively constructible families of graphs are recursive. The authors also conjecture that the converse holds; that is, recursive families are also recursively constructible. In this paper, we provide two specific counterexamples to this conjecture, which we then extend to an infinite family of counterexamples.
0 references
Tutte polynomial
0 references
