The following pages link to Roman Glebov (Q272325):
Displaying 25 items.
- On the maximum number of Latin transversals (Q272327) (← links)
- A problem of Erdős and Sós on 3-graphs (Q273102) (← links)
- Densities in large permutations and parameter testing (Q338581) (← links)
- How many colors guarantee a rainbow matching? (Q405108) (← links)
- On extremal hypergraphs for Hamiltonian cycles (Q412248) (← links)
- Bijective mapping preserving intersecting antichains for \(k\)-valued cubes (Q427862) (← links)
- Finitely forcible graphons and permutons (Q473103) (← links)
- Comparable pairs in families of sets (Q490990) (← links)
- The number of Hamiltonian decompositions of regular graphs (Q1686305) (← links)
- Virtually fibering random right-angled Coxeter groups -- extended abstract (Q1792110) (← links)
- The biased odd cycle game (Q1953485) (← links)
- On the local structure of oriented graphs -- a case study in flag algebras (Q2170792) (← links)
- Compactness and finite forcibility of graphons (Q2327712) (← links)
- (Q2857378) (← links)
- Building Spanning Trees Quickly in Maker-Breaker Games (Q2947437) (← links)
- Biased games on random boards (Q5265341) (← links)
- On the Number of Hamilton Cycles in Sparse Random Graphs (Q5300478) (← links)
- The Threshold Probability for Long Cycles (Q5366938) (← links)
- On covering expander graphs by hamilton cycles (Q5409861) (← links)
- Conflict-Free Colouring of Graphs (Q5418810) (← links)
- (Q5419991) (← links)
- On the Concentration of the Domination Number of the Random Graph (Q5499732) (← links)
- Infinite‐dimensional finitely forcible graphon (Q5741849) (← links)
- Perfect matchings in random subgraphs of regular bipartite graphs (Q6055937) (← links)
- Degree conditions forcing oriented cycles (Q6621208) (← links)
