- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-1297
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
A complexity problem for Borel graphs ; volume:226 ; number:1 ; day:10 ; month:5 ; year:2021 ; pages:225-249 ; date:10.2021
Inventiones mathematicae ; 226, Heft 1 (10.5.2021), 225-249, 10.2021
- Creator
-
Todorčević, Stevo
Vidnyánszky, Zoltán
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00222-021-01047-z
- URN
-
urn:nbn:de:101:1-2021111922390494219656
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:32 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Todorčević, Stevo
- Vidnyánszky, Zoltán
- SpringerLink (Online service)
Other Objects (12)
Borel sets of Rado graphs are Ramsey
The graph isomorphism problem : its structural complexity
Quantum complexity of graph and algebraic problems
Nonstationary problems for equations of Borel-Fuchs type
„Borel".
Classic graph problems made temporal - a parameterized complexity analysis
Classic graph problems made temporal – a parameterized complexity analysis
On the Borel complexity and the complete metrizability of spaces of metrics
Émile Borel
Borel, Ludwig
Borel, Rudolf
Borel, Eugenie
Borel sets of Rado graphs are Ramsey
The graph isomorphism problem : its structural complexity
Quantum complexity of graph and algebraic problems
Nonstationary problems for equations of Borel-Fuchs type
„Borel".
Classic graph problems made temporal - a parameterized complexity analysis
Classic graph problems made temporal – a parameterized complexity analysis
On the Borel complexity and the complete metrizability of spaces of metrics
Émile Borel
Borel, Ludwig
Borel, Rudolf
Borel, Eugenie
Borel sets of Rado graphs are Ramsey
The graph isomorphism problem : its structural complexity
Quantum complexity of graph and algebraic problems
Nonstationary problems for equations of Borel-Fuchs type
„Borel".
Classic graph problems made temporal - a parameterized complexity analysis
Classic graph problems made temporal – a parameterized complexity analysis
On the Borel complexity and the complete metrizability of spaces of metrics
Émile Borel
Borel, Ludwig
Borel, Rudolf