Cargando…
Locally common graphs
Goodman proved that the sum of the number of triangles in a graph on [Formula: see text] nodes and its complement is at least [Formula: see text]; in other words, this sum is minimized, asymptotically, by a random graph with edge density 1/2. Erdős conjectured that a similar inequality will hold for...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
John Wiley and Sons Inc.
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10087361/ https://www.ncbi.nlm.nih.gov/pubmed/37064728 http://dx.doi.org/10.1002/jgt.22881 |