Extended abstracts
Full articles
- H. Hàn, Y. Person, M. Schacht,
Note on forcing pairs,
Proceedings of EuroComb 2011, vol. 38 series Electron. Notes Discrete Math., 437-442
- H. Hàn, Y. Person, M. Schacht,
Note on strong refutation algorithms for random k-SAT formulas,
Proceedings of LAGOS 2009, vol. 35 series Electron. Notes Discrete Math., 157-162
- B. Nagle, A. Poerschke, V. Rödl, M. Schacht,
Hypergraph regularity and quasi-randomness,
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 227-235
- Y. Person, M. Schacht,
Almost all hypergraphs without Fano planes are bipartite,
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 217-226
Short versions
- S. Berger, S. Piga, Chr. Reiher, V. Rödl, M. Schacht,
Turán density of cliques of order five in
3-uniform hypergraphs with quasirandom links,
Proceedings of LAGOS 2021, vol. 195 series Procedia Computer Science, 412-418,
full article
-
P. Araújo, S. Piga, M. Schacht,
Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs,
Proceedings of EuroComb 2019, vol. 88(3) series
Acta Math. Univ. Comenian. (N.S.), 389-394,
full article
-
O. Ebsen, G. S. Maesaka, Chr. Reiher, M. Schacht, B. Schülke,
Powers of Hamiltonian cycles in μ-inseparable graphs,
Proceedings of EuroComb 2019, vol. 88(3) series
Acta Math. Univ. Comenian. (N.S.), 637-641,
full article
-
Chr. Reiher, V. Rödl, A. Ruciński, M. Schacht, B. Schülke,
Minimum pair-degree for tight Hamiltonian cycles in 4-uniform hypergraphs,
Proceedings of EuroComb 2019, vol. 88(3) series
Acta Math. Univ. Comenian. (N.S.), 1023-1027,
full article
- W. Bedenknecht, G. O. Mota, Chr. Reiher, M. Schacht,
On the local density problem for graphs of given odd-girth,
Proceedings of LAGOS 2017, vol. 62 series Electron. Notes Discrete Math., 39-44,
full article
- E. Aigner-Horev, D. Conlon, H. Hàn, Y. Person, M. Schacht,
Quasirandomness in hypergraphs,
Proceedings of EuroComb 2017, vol. 61 series Electron. Notes Discrete Math., 13-19,
full article
- J. de O. Bastos, G. O. Mota, M. Schacht, J. Schnitzer, F. Schulenburg,
Loose Hamiltonian cycles forced by
large (k-2)-degree – sharp version,
Proceedings of EuroComb 2017, vol. 61 series Electron. Notes Discrete Math., 101-106,
full article
- Y. Kohayakawa, G. O. Mota, M. Schacht,
Monochromatic trees in random graphs,
Proceedings of EuroComb 2017, vol. 61 series Electron. Notes Discrete Math., 759-764,
full article
- J. de O. Bastos, G. O. Mota, M. Schacht, J. Schnitzer, F. Schulenburg,
Loose Hamiltonian cycles forced by large (k-2)-degree – approximate version,
Proceedings of the Tenth Jornadas de Matematica Discreta y Algoritmica (JMDA 2016), vol. 54 series Electron. Notes Discrete Math., 325-330,
full article
- B. Nagle, V. Rödl, M. Schacht,
An
algorithmic hypergraph regularity lemma,
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), 1765-1773,
full article
- Y. Kohayakawa, G. O. Mota, M. Schacht, A. Taraz,
A counting lemma for
sparse pseudorandom hypergraphs,
Proceedings of LAGOS 2015, vol. 50 series Electron. Notes Discrete Math., 421-426,
full articles
- H. Hàn, T. Retter, V. Rödl, M. Schacht,
Ramsey-type
numbers involving graphs and hypergraphs with large girth,
Proceedings of LAGOS 2015, vol. 50 series Electron. Notes Discrete Math., 457-463,
full article
- S. Messuti, V. Rödl, M. Schacht,
Packing minor closed families of graphs,
Proceedings of EuroComb 2015, vol. 49 series Electron. Notes Discrete Math., 651-659,
full article
- E. Aigner-Horev, H. Hàn, M. Schacht,
Extremal results for odd cycles in sparse
pseudorandom graphs,
Proceedings of LAGOS 2013, vol. 44 series Electron. Notes Discrete Math., 385-391,
full article
- S. Messuti, M. Schacht,
On the structure of graphs with given odd girth and large minimum degree,
Proceedings of EuroComb 2013, vol. 16, CRM Series, Ed. Norm., Pisa, 521-526,
full article
- G. O. Mota, G. N. Sárközy, M. Schacht, A. Taraz,
Ramsey numbers for bipartite graphs with small bandwidth,
Proceedings of EuroComb 2013, vol. 16, CRM Series, Ed. Norm., Pisa, 165-170,
full article
- E. Buß, H. Hàn, M. Schacht,
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs,
Proceedings of EuroComb 2011, vol. 38 series Electron. Notes Discrete Math., 207-212,
full article
- Y. Person, M. Schacht,
An expected polynomial time algorithm for coloring 2-colorable 3-graphs,
Proceedings of EuroComb 2009, vol. 34 series Electron. Notes Discrete Math., 465-469,
full article
- N. Alon, A. Coja-Oghlan, H. Hàn, M. Kang, V. Rödl, M. Schacht,
Quasi-randomness and algorithmic regularity for graphs with general degree distributions,
Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wrocław, Poland, July 9-13, vol. 4596 series Lecture Notes in Computer Science, 789-800,
full article
- J. Böttcher, M. Schacht, A. Taraz,
Embedding spanning subgraphs of small bandwidth,
Proceedings of EuroComb 2007, vol. 29 series Electron. Notes Discrete Math., 485-489,
full article
- J. Böttcher, M. Schacht, A. Taraz,
On the bandwidth conjecture for 3-colourable graphs,
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), 618-626,
full article
- V. Rödl, M. Schacht,
Property testing in hypergraphs and the removal lemma,
Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), 488-495,
full article
- Chr. Avart, V. Rödl, M. Schacht,
Every Monotone 3-Graph Property is Testable,
Seventh International Colloquium on Graph Theory, vol. 22 series (2005) Electron. Notes Discrete Math., 539-542,
full article
- M. Schacht, A. Taraz,
Globally bounded local edge colourings of hypergraphs,
Proceedings of GRACO 2005, vol. 19 series Electron. Notes Discrete Math., 179-185,
full article
- Y. Kohayakawa, V. Rödl, M. Schacht,
Discrepancy and Eigenvalues of Cayley Graphs,
Proceedings of Eurocomb 2003, vol 145 series ITI Series of Charles University, Prague, 242-246,
full article
|