The following pages link to Alexey Pokrovskiy (Q322268):
Displayed 50 items.
- Rainbow matchings and connectedness of coloured graphs (Q322269) (← links)
- On sets not belonging to algebras and rainbow matchings in graphs (Q345074) (← links)
- Ramsey goodness of paths (Q345089) (← links)
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths (Q402591) (← links)
- Highly linked tournaments (Q491002) (← links)
- Rainbow matchings and rainbow connectedness (Q510322) (← links)
- Growth of graph powers (Q540085) (← links)
- Linearly many rainbow trees in properly edge-coloured complete graphs (Q723883) (← links)
- 2-factors with \(k\) cycles in Hamiltonian graphs (Q777484) (← links)
- (Q1621416) (redirect page) (← links)
- A family of extremal hypergraphs for Ryser's conjecture (Q1621417) (← links)
- An approximate version of a conjecture of Aharoni and Berger (Q1649359) (← links)
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles (Q1686315) (← links)
- Edge-disjoint rainbow trees in properly coloured complete graphs (Q1690046) (← links)
- Graphs without proper subgraphs of minimum degree 3 and short cycles (Q1743173) (← links)
- Isomorphic bisections of cubic graphs (Q1984530) (← links)
- Partitioning a graph into a cycle and a sparse graph (Q2092387) (← links)
- \(C_4\)-free subgraphs with large average degree (Q2130532) (← links)
- Long directed rainbow cycles and rainbow spanning trees (Q2189824) (← links)
- On the odd cycle game and connected rules (Q2198973) (← links)
- Embedding rainbow trees with applications to graph labelling and decomposition (Q2216732) (← links)
- Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
- A proof of Ringel's conjecture (Q2232153) (← links)
- A linear bound on the Manickam-Miklós-Singhi conjecture (Q2347887) (← links)
- Identifying codes and searching with balls in graphs (Q2355743) (← links)
- Strong Ramsey games: drawing on an infinite board (Q2397109) (← links)
- A remark on Hamilton cycles with few colors (Q2657179) (← links)
- (Q2857433) (← links)
- Edge growth in graph powers (Q2876017) (← links)
- PERIODIC SEQUENCES OF ARBITRAGE: A TALE OF FOUR CURRENCIES (Q2895984) (← links)
- Advantage in the discrete Voronoi game (Q2929591) (← links)
- Calculating Ramsey Numbers by Partitioning Colored Graphs (Q2978186) (← links)
- Locally homogeneous structures on Hopf surfaces (Q3002635) (← links)
- Intersecting extremal constructions in Ryser's Conjecture for r-partite hypergraphs (Q4604126) (← links)
- Edge Disjoint Hamiltonian Cycles in Highly Connected Tournaments (Q4611873) (← links)
- Ramsey Goodness of Bounded Degree Trees (Q4635503) (← links)
- Decompositions into spanning rainbow structures (Q4973646) (← links)
- New bounds for Ryser’s conjecture and related problems (Q5071853) (← links)
- Ramsey Goodness of Cycles (Q5128514) (← links)
- A counterexample to Stein’s Equi-$n$-square Conjecture (Q5377048) (← links)
- Halfway to Rota’s Basis Conjecture (Q5853702) (← links)
- Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles (Q5854893) (← links)
- Short Proofs of Rainbow Matchings Results (Q6114767) (← links)
- Embedding rainbow trees with applications to graph labelling and decomposition (Q6298823) (← links)
- On Kahn's basis conjecture (Q6308391) (← links)
- The maximum length of $K_r$-Bootstrap Percolation (Q6321855) (← links)
- Size-Ramsey numbers of powers of hypergraph trees and long subdivisions (Q6361964) (← links)
- A random Hall-Paige conjecture (Q6397009) (← links)
- Chi-boundedness of graphs containing no cycles with $k$ chords (Q6409361) (← links)
- The Tur\'an density of tight cycles in three-uniform hypergraphs (Q6411043) (← links)