Search results for "Mathias Schacht"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht	Weak quasi-randomness for uniform hypergraphs.	Random Struct. Algorithms	2012	DBLP DOI BibTeX RDF
1	Enno Buß, Hiêp Hàn, Mathias Schacht	Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs.	Electronic Notes in Discrete Mathematics	2011	DBLP DOI BibTeX RDF
1	Hiêp Hàn, Yury Person, Mathias Schacht	Note on forcing pairs.	Electronic Notes in Discrete Mathematics	2011	DBLP DOI BibTeX RDF
1	Yury Person, Mathias Schacht	An expected polynomial time algorithm for coloring 2-colorable 3-graphs.	Discrete Mathematics & Theoretical Computer Science	2011	DBLP BibTeX RDF
1	Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky	Untangling planar graphs from a specified vertex position - Hard cases.	Discrete Applied Mathematics	2011	DBLP DOI BibTeX RDF
1	Hiêp Hàn, Mathias Schacht	Dirac-type results for loose Hamilton cycles in uniform hypergraphs.	J. Comb. Theory, Ser. B	2010	DBLP DOI BibTeX RDF
1	Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht	Weak hypergraph regularity and linear hypergraphs.	J. Comb. Theory, Ser. B	2010	DBLP DOI BibTeX RDF
1	Ehud Friedgut, Vojtech Rödl, Mathias Schacht	Ramsey properties of random discrete structures.	Random Struct. Algorithms	2010	DBLP DOI BibTeX RDF
1	Jan Hladký, Mathias Schacht	Note on Bipartite Graph Tilings.	SIAM J. Discrete Math.	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht	Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
1	Hiêp Hàn, Yury Person, Mathias Schacht	Note on strong refutation algorithms for random k-SAT formulas.	Electronic Notes in Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Yury Person, Mathias Schacht	An expected polynomial time algorithm for coloring 2-colorable 3-graphs.	Electronic Notes in Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht	On Colourings of Hypergraphs Without Monochromatic Fano Planes.	Combinatorics, Probability & Computing	2009	DBLP DOI BibTeX RDF
1	Vojtech Rödl, Mathias Schacht	Generalizations of the removal lemma.	Combinatorica	2009	DBLP DOI BibTeX RDF
1	Hiêp Hàn, Yury Person, Mathias Schacht	On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree.	SIAM J. Discrete Math.	2009	DBLP DOI BibTeX RDF
1	Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht	Hypergraph regularity and quasi-randomness.	SODA	2009	DBLP DOI BibTeX RDF
1	Yury Person, Mathias Schacht	Almost all hypergraphs without Fano planes are bipartite.	SODA	2009	DBLP DOI BibTeX RDF
1	Julia Böttcher, Mathias Schacht, Anusch Taraz	Spanning 3-colourable subgraphs of small bandwidth in dense graphs.	J. Comb. Theory, Ser. B	2008	DBLP DOI BibTeX RDF
1	Brendan Nagle, Vojtech Rödl, Mathias Schacht	Note on the 3-graph counting lemma.	Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht	On the Ramsey Number of Sparse 3-Graphs.	Graphs and Combinatorics	2008	DBLP DOI BibTeX RDF
1	Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky	Obfuscated Drawings of Planar Graphs	CoRR	2008	DBLP BibTeX RDF
1	Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige	Integer and fractional packings of hypergraphs.	J. Comb. Theory, Ser. B	2007	DBLP DOI BibTeX RDF
1	Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa Sissokho, Jozef Skokan	Turán's theorem for pseudo-random graphs.	J. Comb. Theory, Ser. A	2007	DBLP DOI BibTeX RDF
1	Julia Böttcher, Mathias Schacht, Anusch Taraz	Embedding spanning subgraphs of small bandwidth.	Electronic Notes in Discrete Mathematics	2007	DBLP DOI BibTeX RDF
1	Vojtech Rödl, Mathias Schacht	Regular Partitions of Hypergraphs: Counting Lemmas.	Combinatorics, Probability & Computing	2007	DBLP DOI BibTeX RDF
1	Vojtech Rödl, Mathias Schacht	Regular Partitions of Hypergraphs: Regularity Lemmas.	Combinatorics, Probability & Computing	2007	DBLP DOI BibTeX RDF
1	Vojtech Rödl, Andrzej Rucinski, Mathias Schacht	Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs.	SIAM J. Discrete Math.	2007	DBLP DOI BibTeX RDF
1	Christian Avart, Vojtech Rödl, Mathias Schacht	Every Monotone 3-Graph Property is Testable.	SIAM J. Discrete Math.	2007	DBLP DOI BibTeX RDF
1	Julia Böttcher, Mathias Schacht, Anusch Taraz	On the bandwidth conjecture for 3-colourable graphs.	SODA	2007	DBLP DOI BibTeX RDF
1	Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht	Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions.	ICALP	2007	DBLP DOI BibTeX RDF	quasi-random graphs, Laplacian eigenvalues, Grothendieck’s inequality, regularity lemma, sparse graphs
1	Vojtech Rödl, Mathias Schacht	Property testing in hypergraphs and the removal lemma.	STOC	2007	DBLP DOI BibTeX RDF	hereditary properties, removal lemma, hypergraphs, property testing, regularity lemma
1	Brendan Nagle, Vojtech Rödl, Mathias Schacht	The counting lemma for regular k-uniform hypergraphs.	Random Struct. Algorithms	2006	DBLP DOI BibTeX RDF
1	Mathias Schacht, Anusch Taraz	Globally bounded local edge colourings of hypergraphs.	Electronic Notes in Discrete Mathematics	2005	DBLP DOI BibTeX RDF
1	Christian Avart, Vojtech Rödl, Mathias Schacht	Every Monotone 3-Graph Property is Testable.	Electronic Notes in Discrete Mathematics	2005	DBLP DOI BibTeX RDF
1	Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht	The Turán Theorem for Random Graphs.	Combinatorics, Probability & Computing	2004	DBLP DOI BibTeX RDF

Publications of "Mathias Schacht" ( http://dblp.L3S.de/Authors/Mathias_Schacht )