Non-recursively constructible recursive families of graphs (Q426873)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6045702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-recursively constructible recursive families of graphs |
scientific article; zbMATH DE number 6045702 |
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
0.7576714754104614
0 references
0.6860249638557434
0 references
0.6856174468994141
0 references
