Monografie
Homomorphism thresholds and embeddings of spanning subgraphs in dense graphs
- Sprache
-
Englisch
- Identifier
-
1241249172
Thema
Kombinatorik; Diskrete Mathematik; Graphentheorie; Kombinatorische Graphentheorie; Kreis ; Taillenweite
Beteiligte Personen und Organisationen
Ebsen, Oliver-Andre
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:56 MEZ
Objekttyp
- Monografie
Beteiligte
- Ebsen, Oliver-Andre
Ähnliche Objekte (12)
On combinatorial search problems which involve graphs
Embeddings of cycle-like structures
Bicycles and left-right tours in locally finite graphs
On Pairwise Graph Connectivity
Topological paths and cycles in infinite graphs
On the homology of infinite graphs with ends
Cycle decompositions and t-perfect graphs
Investigations into the structure of infinite matroids
Embeddings and decompositions of graphs and hypergraphs
Persistent arrays, path problems, and context-free languages
Connectivity and tree structure in infinite graphs and digraphs
Combinatorial and graph theoretical aspects of two-edge connected reliability
On combinatorial search problems which involve graphs
Embeddings of cycle-like structures
Bicycles and left-right tours in locally finite graphs
On Pairwise Graph Connectivity
Topological paths and cycles in infinite graphs
On the homology of infinite graphs with ends
Cycle decompositions and t-perfect graphs
Investigations into the structure of infinite matroids
Embeddings and decompositions of graphs and hypergraphs
Persistent arrays, path problems, and context-free languages
Connectivity and tree structure in infinite graphs and digraphs
Combinatorial and graph theoretical aspects of two-edge connected reliability
On combinatorial search problems which involve graphs
Embeddings of cycle-like structures
Bicycles and left-right tours in locally finite graphs
On Pairwise Graph Connectivity
Topological paths and cycles in infinite graphs
On the homology of infinite graphs with ends
Cycle decompositions and t-perfect graphs
Investigations into the structure of infinite matroids
Embeddings and decompositions of graphs and hypergraphs
Persistent arrays, path problems, and context-free languages
Connectivity and tree structure in infinite graphs and digraphs