Resilience and anti-Ramsey properties of sparse random graphs and dense hypergraphs
- Alternative title
-
Ausfallsicherheit und Anti-Ramsey-Eigenschaften von dünnen Zufallsgraphen und dichten Hypergraphen
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Hamburg, Universität Hamburg, Dissertation, 2018
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Hamburg
- (who)
-
Staats- und Universitätsbibliothek Hamburg
- (when)
-
2018
- Creator
-
Schnitzer, Jakob
- Contributor
-
Schacht, Mathias
- URN
-
urn:nbn:de:gbv:18-90921
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:49 PM CET
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
- Schnitzer, Jakob
- Schacht, Mathias
- Staats- und Universitätsbibliothek Hamburg
Time of origin
- 2018
Other Objects (12)
Dense peelable random uniform hypergraphs
Sparse random models in combinatorics
Random perturbation of sparse graphs
The rank of sparse random matrices
Verification methods for dense and sparse systems of equations
Calculating Sparse and Dense Correspondences for Near-Isometric Shapes
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Computation of sparse and dense equilibrium strategies of evolutionary games
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Extremal problems in random graphs : Ramsey and Turán type results
Threshold phenomena in branching trees and sparse random graphs
On random reductions from sparse sets to tally sets
Dense peelable random uniform hypergraphs
Sparse random models in combinatorics
Random perturbation of sparse graphs
The rank of sparse random matrices
Verification methods for dense and sparse systems of equations
Calculating Sparse and Dense Correspondences for Near-Isometric Shapes
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Computation of sparse and dense equilibrium strategies of evolutionary games
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Extremal problems in random graphs : Ramsey and Turán type results
Threshold phenomena in branching trees and sparse random graphs
On random reductions from sparse sets to tally sets
Dense peelable random uniform hypergraphs
Sparse random models in combinatorics
Random perturbation of sparse graphs
The rank of sparse random matrices
Verification methods for dense and sparse systems of equations
Calculating Sparse and Dense Correspondences for Near-Isometric Shapes
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Computation of sparse and dense equilibrium strategies of evolutionary games
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Extremal problems in random graphs : Ramsey and Turán type results
Threshold phenomena in branching trees and sparse random graphs