Resilience and anti-Ramsey properties of sparse random graphs and dense hypergraphs
- Weitere Titel
-
Ausfallsicherheit und Anti-Ramsey-Eigenschaften von dünnen Zufallsgraphen und dichten Hypergraphen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Hamburg, Universität Hamburg, Dissertation, 2018
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Hamburg
- (wer)
-
Staats- und Universitätsbibliothek Hamburg
- (wann)
-
2018
- Urheber
-
Schnitzer, Jakob
- Beteiligte Personen und Organisationen
-
Schacht, Mathias
- URN
-
urn:nbn:de:gbv:18-90921
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:59 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Schnitzer, Jakob
- Schacht, Mathias
- Staats- und Universitätsbibliothek Hamburg
Entstanden
- 2018
Ähnliche Objekte (12)
Sparse signals on hypergraphs
Dense peelable random uniform hypergraphs
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs
Sparse 0-1-Matrices and Forbidden Hypergraphs
Existence and enumeration of spanning structures in sparse graphs and hypergraphs
Blocks of hypergraphs : applied to hypergraphs and outerplanarity
Quasi-random hypergraphs and extremal problems for hypergraphs
Ramsey’s conditionals
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Verification methods for dense and sparse systems of equations
Calculating Sparse and Dense Correspondences for Near-Isometric Shapes
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Sparse signals on hypergraphs
Dense peelable random uniform hypergraphs
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs
Sparse 0-1-Matrices and Forbidden Hypergraphs
Existence and enumeration of spanning structures in sparse graphs and hypergraphs
Blocks of hypergraphs : applied to hypergraphs and outerplanarity
Quasi-random hypergraphs and extremal problems for hypergraphs
Ramsey’s conditionals
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Verification methods for dense and sparse systems of equations
Calculating Sparse and Dense Correspondences for Near-Isometric Shapes
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Sparse signals on hypergraphs
Dense peelable random uniform hypergraphs
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs
Sparse 0-1-Matrices and Forbidden Hypergraphs
Existence and enumeration of spanning structures in sparse graphs and hypergraphs
Blocks of hypergraphs : applied to hypergraphs and outerplanarity
Quasi-random hypergraphs and extremal problems for hypergraphs
Ramsey’s conditionals
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Verification methods for dense and sparse systems of equations
Calculating Sparse and Dense Correspondences for Near-Isometric Shapes