The following pages link to Andrzej Ruciński (Q226978):
Displaying 50 items.
- Hamilton saturated hypergraphs of essentially minimum size (Q1953507) (← links)
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma (Q1964595) (← links)
- Solitary subgraphs of random graphs (Q1970715) (← links)
- Variations on twins in permutations (Q2048547) (← links)
- Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\) (Q2111195) (← links)
- Covering the edges of a random hypergraph by cliques (Q2158205) (← links)
- On the minimum size of Hamilton saturated hypergraphs (Q2213813) (← links)
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs (Q2220980) (← links)
- Constructive Ramsey numbers for loose hyperpaths (Q2294702) (← links)
- Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three (Q2363695) (← links)
- Ramsey properties of random graphs and folkman numbers (Q2364094) (← links)
- Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three (Q2374165) (← links)
- Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs (Q2431088) (← links)
- Approximate counting of regular hypergraphs (Q2445249) (← links)
- Families of triples with high minimum degree are Hamiltonian (Q2450131) (← links)
- Short paths in quasi-random triple systems with sparse underlying graphs (Q2496208) (← links)
- Neighbour-distinguishing edge colourings of random regular graphs (Q2500996) (← links)
- The deletion method for upper tail estimates (Q2567402) (← links)
- Properly colored Hamilton cycles in Dirac-type hypergraphs (Q2692184) (← links)
- Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma (Q2784462) (← links)
- (Q2785564) (← links)
- On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size (Q2883857) (← links)
- An Improved Upper Bound on the Density of Universal Random Graphs (Q2894468) (← links)
- Universality of Random Graphs (Q2902906) (← links)
- COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY (Q3069732) (← links)
- (Q3078214) (← links)
- (Q3139769) (← links)
- Approximate Counting of Matchings in (3,3)-Hypergraphs (Q3188911) (← links)
- (Q3203051) (← links)
- (Q3203052) (← links)
- (Q3333079) (← links)
- (Q3349677) (← links)
- Small cliques in random graphs (Q3360207) (← links)
- (Q3360223) (← links)
- A Dirac-Type Theorem for 3-Uniform Hypergraphs (Q3373667) (← links)
- A sharp threshold for random graphs with a monochromatic triangle in every edge coloring (Q3377334) (← links)
- (Q3378337) (← links)
- (Q3390429) (← links)
- Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs (Q3503227) (← links)
- Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs (Q3557058) (← links)
- The Ramsey Number for 3-Uniform Tight Hypergraph Cycles (Q3557509) (← links)
- (Q3568712) (← links)
- (Q3579496) (← links)
- The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249) (← links)
- (Q3715150) (← links)
- Poisson convergence and semi-induced properties of random graphs (Q3763307) (← links)
- (Q3781137) (← links)
- (Q3785678) (← links)
- Strongly balanced graphs and random graphs (Q3795707) (← links)
- (Q3816113) (← links)
