Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Schacht, Mathias"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
Enno Buß
,
Hiêp Hàn
,
Mathias Schacht
Journal of Combinatorial Theory Series B
103
(6), 2013, pp. 658-678
Quasi-randomness and algorithmic regularity for graphs with general degree distributions
Noga Alon
,
Amin Coja-Oghlan
,
Hiêp Hàn
,
Mihyun Kang
,
Vojtȇch Rödl
,
Mathias Schacht
SIAM Journal on Computing
39
(6), 2010, pp. 2336-2362
Dirac-type results for loose Hamilton cycles in uniform hypergraphs
Hiệp Hàn
,
Mathias Schacht
Journal of Combinatorial Theory Series B
100
(3), 2010, pp. 332-346
Note on bipartite graph tilings
Jan Hladký
,
Mathias Schacht
SIAM Journal on Discrete Mathematics
24
(2), 2010, pp. 357-362
Weak hypergraph regularity and linear hypergraphs
Yoshiharu Kohayakawa
,
Brendan Nagle
,
Vojtȇch Rödl
,
Mathias Schacht
Journal of Combinatorial Theory Series B
100
(2), 2010, pp. 151-160
On perfect matchings in uniform hypergraphs with large minimum vertex degree
Hiệp Hàn
,
Yury Person
,
Mathias Schacht
SIAM Journal on Discrete Mathematics
23
(2), 2009, pp. 732-748
Generalizations of the removal lemma
Vojtȇch Rödl
,
Mathias Schacht
Combinatorica
29
(4), 2009, pp. 467-501
Spanning 3-colourable subgraphs of small bandwidth in dense graphs
Julia Böttcher
,
Mathias Schacht
,
Anusch Taraz
Journal of Combinatorial Theory Series B
98
(4), 2008, pp. 752-777
On the Ramsey number of sparse 3-graphs
Brendan Nagle
,
Sayaka Olsen
,
Vojtȇch Rödl
,
Mathias Schacht
Graphs and Combinatorics
24
(3), 2008, pp. 205-228
Quasi-randomness and algorithmic regularity for graphs with general degree distributions
Noga Alon
,
Amin Coja-Oghlan
,
Hiệp Hàn
,
Mihyun Kang
,
Vojtȇch Rödl
,
Mathias Schacht
Lecture Notes in Computer Science
4596
, 2007, pp. 789-800
Every monotone 3-graph property is testable
Christian Avart
,
Vojtȇch Rödl
,
Mathias Schacht
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 73-92
Turán's theorem for pseudo-random graphs
Yoshiharu Kohayakawa
,
Vojtȇch Rödl
,
Mathias Schacht
,
Papa Sissokho
,
Jozef Skokan
Journal of Combinatorial Theory Series A
114
(4), 2007, pp. 631-657
Ramsey properties of random
k
-partite,
k
-uniform hypergraphs
Vojtȇch Rödl
,
Andrzej Ruciński
,
Mathias Schacht
SIAM Journal on Discrete Mathematics
21
(2), 2007, pp. 442-460
Extremal results for odd cycles in sparse pseudorandom graphs
Elad Aigner-Horev
,
Hiệp Hàn
,
Mathias Schacht
Combinatorica
34
(4), 2003, pp. 379-406