Weakly distinguishing graph polynomials on addable properties (Q2211265)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Weakly distinguishing graph polynomials on addable properties |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weakly distinguishing graph polynomials on addable properties |
scientific article |
Statements
Weakly distinguishing graph polynomials on addable properties (English)
0 references
10 November 2020
0 references
graph polynomials
0 references
random graphs
0 references
Bollobás-Pebody-Riordan conjecture
0 references
addable graph classes
0 references
0.8944225311279297
0 references
0.7433377504348755
0 references
0.7209421396255493
0 references
0.7209421396255493
0 references
