Mathias Schacht

From MaRDI portal
Revision as of 15:31, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:273185

Available identifiers

zbMath Open schacht.mathiasDBLP72/7044WikidataQ1908555 ScholiaQ1908555MaRDI QIDQ273185

List of research outcomes





PublicationDate of PublicationType
Equivalent regular partitions of three-uniform hypergraphs2024-11-20Paper
Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs2024-10-18Paper
Powers of Hamiltonian cycles in \(\mu\)-inseparable graphs2024-10-18Paper
Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs2024-10-18Paper
Restricted problems in extremal combinatorics2024-03-20Paper
Ramsey properties of randomly perturbed hypergraphs2023-11-03Paper
High powers of Hamiltonian cycles in randomly augmented graphs2023-10-04Paper
On quantitative aspects of a canonisation theorem for edge‐orderings2023-08-22Paper
On the size-Ramsey number of grid graphs2023-03-30Paper
Ramsey-type numbers involving graphs and hypergraphs with large girth2023-03-30Paper
Canonical colourings in random graphs2023-03-20Paper
Sharp thresholds for Ramsey properties2022-07-28Paper
Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs2022-01-07Paper
On the local density problem for graphs of given odd-girth2021-06-25Paper
Hamiltonian Berge cycles in random hypergraphs2021-06-15Paper
On the structure of Dense graphs with bounded clique number2021-04-30Paper
Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs2021-01-25Paper
Embedding spanning subgraphs in uniformly dense and inseparable graphs2021-01-05Paper
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs2020-09-16Paper
Homomorphism thresholds for odd cycles2020-08-11Paper
Powers of Hamiltonian cycles in randomly augmented graphs2020-06-19Paper
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs2019-10-17Paper
Odd cycles in subgraphs of sparse pseudorandom graphs2019-06-12Paper
https://portal.mardi4nfdi.de/entity/Q46338282019-05-06Paper
https://portal.mardi4nfdi.de/entity/Q46338302019-05-06Paper
FORCING QUASIRANDOMNESS WITH TRIANGLES2019-04-30Paper
Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version2019-03-05Paper
On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs2019-02-06Paper
Monochromatic trees in random graphs2019-01-31Paper
Some Remarks on π2018-10-09Paper
Quasirandomness in hypergraphs2018-09-07Paper
An Algorithmic Hypergraph Regularity Lemma2018-07-16Paper
An algorithmic hypergraph regularity lemma2018-06-07Paper
On a Turán problem in weakly quasirandom 3-uniform hypergraphs2018-05-25Paper
On the local density problem for graphs of given odd-girth2018-04-09Paper
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs2018-03-16Paper
A Note on Induced Ramsey Numbers2018-02-26Paper
Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version2018-01-18Paper
Monochromatic trees in random graphs2018-01-18Paper
Quasirandomness in hypergraphs2018-01-18Paper
Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs2018-01-16Paper
Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version2017-10-24Paper
Counting results for sparse pseudorandom hypergraphs. I.2017-08-31Paper
Counting results for sparse pseudorandom hypergraphs. II.2017-08-31Paper
Ramsey properties of random graphs and folkman numbers2017-07-17Paper
On the Hamiltonicity of triple systems with high minimum degree2017-04-12Paper
Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version2017-02-13Paper
Extremal results for random discrete structures2016-12-07Paper
Discrepancy and eigenvalues of Cayley graphs2016-10-26Paper
A counting lemma for sparse pseudorandom hypergraphs2016-10-17Paper
Ramsey-type numbers involving graphs and hypergraphs with large girth2016-10-17Paper
Packing minor closed families of graphs2016-10-14Paper
Embedding tetrahedra into quasirandom hypergraphs2016-10-12Paper
A sharp threshold for van der Waerden's theorem in random subsets2016-10-10Paper
Packing minor-closed families of graphs into complete graphs2016-04-21Paper
On the Structure of Graphs with Given Odd Girth and Large Minimum Degree2015-09-29Paper
Ramsey numbers for bipartite graphs with small bandwidth2015-06-02Paper
Extremal results for odd cycles in sparse pseudorandom graphs2015-01-08Paper
https://portal.mardi4nfdi.de/entity/Q29346452014-12-18Paper
On the KŁR conjecture in random graphs2014-12-02Paper
https://portal.mardi4nfdi.de/entity/Q54199602014-06-11Paper
https://portal.mardi4nfdi.de/entity/Q54200152014-06-11Paper
Extremal Results in Random Graphs2014-05-19Paper
https://portal.mardi4nfdi.de/entity/Q54030582014-03-25Paper
Upper bounds on probability thresholds for asymmetric Ramsey properties2014-01-28Paper
Minimum vertex degree conditions for loose Hamilton cycles in $3$-uniform hypergraphs2013-11-01Paper
https://portal.mardi4nfdi.de/entity/Q28573842013-11-01Paper
An expected polynomial time algorithm for coloring 2-colorable 3-graphs2013-10-10Paper
Note on strong refutation algorithms for random k-SAT formulas2013-07-19Paper
Tree-minimal graphs are almost regular2013-07-12Paper
Complete Partite subgraphs in dense hypergraphs2012-12-14Paper
On Even-Degree Subgraphs of Linear Hypergraphs2012-05-14Paper
Weak quasi-randomness for uniform hypergraphs2012-03-07Paper
A structural result for hypergraphs with many restricted edge colorings2011-06-27Paper
Untangling planar graphs from a specified vertex position-Hard cases2011-05-17Paper
Note on Bipartite Graph Tilings2011-04-15Paper
Sparse partition universal graphs for graphs of bounded degree2011-03-29Paper
https://portal.mardi4nfdi.de/entity/Q30782082011-02-18Paper
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions2011-01-17Paper
Ramsey properties of random discrete structures2010-12-14Paper
https://portal.mardi4nfdi.de/entity/Q30608652010-12-13Paper
Generalizations of the removal lemma2010-08-13Paper
https://portal.mardi4nfdi.de/entity/Q35687122010-06-15Paper
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree2010-06-01Paper
On Colourings of Hypergraphs Without Monochromatic Fano Planes2010-04-22Paper
Weak hypergraph regularity and linear hypergraphs2010-04-21Paper
Dirac-type results for loose Hamilton cycles in uniform hypergraphs2010-04-21Paper
On the Ramsey number of sparse 3-graphs2009-05-08Paper
https://portal.mardi4nfdi.de/entity/Q35496482009-01-05Paper
Proof of the bandwidth conjecture of Bollobás and Komlós2008-12-01Paper
Note on the 3-graph counting Lemma2008-09-04Paper
Spanning 3-colourable subgraphs of small bandwidth in dense graphs2008-07-24Paper
Embedding spanning subgraphs of small bandwidth2008-06-05Paper
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs2008-05-22Paper
The hypergraph regularity method and its applications2008-05-07Paper
Every Monotone 3‐Graph Property is Testable2008-03-28Paper
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions2007-11-28Paper
Essentially infinite colourings of hypergraphs2007-11-27Paper
Regular Partitions of Hypergraphs: Regularity Lemmas2007-11-22Paper
Regular Partitions of Hypergraphs: Counting Lemmas2007-11-22Paper
Density theorems and extremal hypergraph problems2007-10-09Paper
How Much Work Does It Take To Straighten a Plane Graph Out?2007-07-23Paper
Every Monotone 3-Graph Property is Testable2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34396812007-05-29Paper
Turán's theorem for pseudo-random graphs2007-05-10Paper
https://portal.mardi4nfdi.de/entity/Q34248862007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q34249002007-03-05Paper
Integer and fractional packings of hypergraphs2007-02-13Paper
The counting lemma for regular k‐uniform hypergraphs2006-05-16Paper
The Turn Theorem for Random Graphs2004-09-07Paper
Tur\'an density of cliques of order five in $3$-uniform hypergraphs with quasirandom linksN/APaper
Tight Hamiltonicity from dense links of triplesN/APaper

Research outcomes over time

This page was built for person: Mathias Schacht