There is no universal countable pentagon‐free graph (Q4297819): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Gregory L. Cherlin / rank | |||
Property / author | |||
Property / author: Gregory L. Cherlin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/jgt.3190180405 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2009418635 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 22:24, 19 March 2024
scientific article; zbMATH DE number 599618
Language | Label | Description | Also known as |
---|---|---|---|
English | There is no universal countable pentagon‐free graph |
scientific article; zbMATH DE number 599618 |
Statements
There is no universal countable pentagon‐free graph (English)
0 references
4 July 1994
0 references
pentagon-free graph
0 references
universal countable graph
0 references
circuits
0 references