Found: 15
Select item for more details and to access through your institution.
Near-perfect clique-factors in sparse pseudorandom graphs.
- Published in:
- Combinatorics, Probability & Computing, 2021, v. 30, n. 4, p. 570, doi. 10.1017/S0963548320000577
- By:
- Publication type:
- Article
Finding tight Hamilton cycles in random hypergraphs faster.
- Published in:
- Combinatorics, Probability & Computing, 2021, v. 30, n. 2, p. 239, doi. 10.1017/S0963548320000450
- By:
- Publication type:
- Article
Largest Components in Random Hypergraphs.
- Published in:
- Combinatorics, Probability & Computing, 2018, v. 27, n. 5, p. 741, doi. 10.1017/S096354831800010X
- By:
- Publication type:
- Article
Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs.
- Published in:
- Combinatorics, Probability & Computing, 2016, v. 25, n. 6, p. 850, doi. 10.1017/S0963548315000395
- By:
- Publication type:
- Article
On Colourings of Hypergraphs Without Monochromatic Fano Planes.
- Published in:
- Combinatorics, Probability & Computing, 2009, v. 18, n. 5, p. 803, doi. 10.1017/S0963548309009948
- By:
- Publication type:
- Article
EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS.
- Published in:
- Mathematika, 2020, v. 66, n. 2, p. 422, doi. 10.1112/mtk.12005
- By:
- Publication type:
- Article
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS.
- Published in:
- Forum of Mathematics, Sigma, 2017, v. 5, p. 1, doi. 10.1017/fms.2017.22
- By:
- Publication type:
- Article
Universality for bounded degree spanning trees in randomly perturbed graphs.
- Published in:
- Random Structures & Algorithms, 2019, v. 55, n. 4, p. 854, doi. 10.1002/rsa.20850
- By:
- Publication type:
- Article
Spanning structures and universality in sparse hypergraphs.
- Published in:
- Random Structures & Algorithms, 2016, v. 49, n. 4, p. 819, doi. 10.1002/rsa.20690
- By:
- Publication type:
- Article
Tight Hamilton Cycles in Random Hypergraphs.
- Published in:
- Random Structures & Algorithms, 2015, v. 46, n. 3, p. 446, doi. 10.1002/rsa.20519
- By:
- Publication type:
- Article
A randomized version of Ramsey's theorem.
- Published in:
- Random Structures & Algorithms, 2012, v. 41, n. 4, p. 488, doi. 10.1002/rsa.20449
- By:
- Publication type:
- Article
Weak quasi-randomness for uniform hypergraphs.
- Published in:
- Random Structures & Algorithms, 2012, v. 40, n. 1, p. 1, doi. 10.1002/rsa.20389
- By:
- Publication type:
- Article
Finding any given 2‐factor in sparse pseudorandom graphs efficiently.
- Published in:
- Journal of Graph Theory, 2021, v. 96, n. 1, p. 87, doi. 10.1002/jgt.22576
- By:
- Publication type:
- Article
Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs.
- Published in:
- Journal of Graph Theory, 2013, v. 73, n. 1, p. 1, doi. 10.1002/jgt.21653
- By:
- Publication type:
- Article
On the rank of higher inclusion matrices.
- Published in:
- Journal of the London Mathematical Society, 2014, v. 90, n. 2, p. 333, doi. 10.1112/jlms/jdu029
- By:
- Publication type:
- Article