The following pages link to Mathias Schacht (Q273185):
Displaying 50 items.
- Packing minor-closed families of graphs into complete graphs (Q273186) (← links)
- Packing minor closed families of graphs (Q322346) (← links)
- A counting lemma for sparse pseudorandom hypergraphs (Q324872) (← links)
- Ramsey-type numbers involving graphs and hypergraphs with large girth (Q324890) (← links)
- Embedding tetrahedra into quasirandom hypergraphs (Q326814) (← links)
- Extremal results for random discrete structures (Q350549) (← links)
- Tree-minimal graphs are almost regular (Q353399) (← links)
- (Q476515) (redirect page) (← links)
- On the KŁR conjecture in random graphs (Q476516) (← links)
- Extremal results for odd cycles in sparse pseudorandom graphs (Q484999) (← links)
- Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version (Q510620) (← links)
- On the Hamiltonicity of triple systems with high minimum degree (Q521911) (← links)
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- A structural result for hypergraphs with many restricted edge colorings (Q547872) (← links)
- Sparse partition universal graphs for graphs of bounded degree (Q633606) (← links)
- Homomorphism thresholds for odd cycles (Q783242) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- Turán's theorem for pseudo-random graphs (Q880006) (← links)
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- Note on the 3-graph counting Lemma (Q941395) (← links)
- Proof of the bandwidth conjecture of Bollobás and Komlós (Q957895) (← links)
- Weak hypergraph regularity and linear hypergraphs (Q965243) (← links)
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs (Q965258) (← links)
- Generalizations of the removal lemma (Q987562) (← links)
- On the Ramsey number of sparse 3-graphs (Q1015430) (← links)
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version (Q1689892) (← links)
- Monochromatic trees in random graphs (Q1690004) (← links)
- On a Turán problem in weakly quasirandom 3-uniform hypergraphs (Q1751613) (← links)
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs (Q2220980) (← links)
- Ramsey numbers for bipartite graphs with small bandwidth (Q2346589) (← links)
- Ramsey properties of random graphs and folkman numbers (Q2364094) (← links)
- Density theorems and extremal hypergraph problems (Q2382340) (← links)
- Counting results for sparse pseudorandom hypergraphs. I. (Q2400983) (← links)
- Counting results for sparse pseudorandom hypergraphs. II. (Q2400984) (← links)
- On the local density problem for graphs of given odd-girth (Q2413148) (← links)
- A sharp threshold for van der Waerden's theorem in random subsets (Q2826230) (← links)
- Discrepancy and eigenvalues of Cayley graphs (Q2828826) (← links)
- Note on strong refutation algorithms for random k-SAT formulas (Q2840534) (← links)
- An expected polynomial time algorithm for coloring 2-colorable 3-graphs (Q2851504) (← links)
- Minimum vertex degree conditions for loose Hamilton cycles in $3$-uniform hypergraphs (Q2857346) (← links)
- (Q2857384) (← links)
- Upper bounds on probability thresholds for asymmetric Ramsey properties (Q2874080) (← links)
- On Even-Degree Subgraphs of Linear Hypergraphs (Q2883855) (← links)
- (Q2934645) (← links)
- On the Structure of Graphs with Given Odd Girth and Large Minimum Degree (Q2947860) (← links)
- (Q3060865) (← links)
- Ramsey properties of random discrete structures (Q3061178) (← links)
- Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions (Q3068635) (← links)
- (Q3078208) (← links)
- Weak quasi-randomness for uniform hypergraphs (Q3119042) (← links)