On universal graphs with forbidden topological subgraphs (Q1068096): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0195-6698(85)80008-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2022478833 / rank | |||
Normal rank |
Latest revision as of 11:21, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On universal graphs with forbidden topological subgraphs |
scientific article |
Statements
On universal graphs with forbidden topological subgraphs (English)
0 references
1985
0 references
A graph \(G^*\) is called universal in a class \(\bar G\) of countable graphs if it contains a copy of every G in \(\bar G.\) The graph \(G^*\) is called strongly universal if every G in \(\bar G\) is isomorphic to an induced subgraph of \(G^*\). For each pair n and m of positive integers, let \(\bar G(\)n,m) represent the class of all countable graphs not admitting \(K^{n,m}\) as a subdivision. Halin has asserted that for n,m sufficiently large \(\bar G(\)n,m) has no universal element. The author proves this conjecture. He also shows that \(\bar G(\)2,3) contains a universal element but no strongly universal one.
0 references
strongly universal graphs
0 references
0 references