Universal graphs without large bipartite subgraphs (Q3344235): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: The axiom of constructibility. A guide for the mathematician / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Notes on combinatorial set theory / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1112/s002557930001250x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2166695258 / rank | |||
Normal rank | |||
Latest revision as of 09:22, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Universal graphs without large bipartite subgraphs |
scientific article |
Statements
Universal graphs without large bipartite subgraphs (English)
0 references
1984
0 references
infinite graphs
0 references
universal graph
0 references
forbidden subgraphs
0 references
