Mixing is hard for triangle-free reflexive graphs (Q6146497)
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: Mixing is hard for triangle-free reflexive graphs |
scientific article; zbMATH DE number 7799822
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mixing is hard for triangle-free reflexive graphs |
scientific article; zbMATH DE number 7799822 |
Statements
Mixing is hard for triangle-free reflexive graphs (English)
0 references
5 February 2024
0 references
simplicial complex
0 references
Hom-graph
0 references
0.740260660648346
0 references
0.7136713862419128
0 references
0.7130796909332275
0 references
0.7075579166412354
0 references
0.7063817381858826
0 references
