The following pages link to Andrzej Dudek (Q267203):
Displayed 42 items.
- Vertex colorings of graphs without short odd cycles (Q3096961) (← links)
- Cops and Robbers on Geometric Graphs (Q3168443) (← links)
- Approximate Counting of Matchings in (3,3)-Hypergraphs (Q3188911) (← links)
- (Q3378337) (← links)
- (Q3390429) (← links)
- Rainbow Connection of Random Regular Graphs (Q3452164) (← links)
- Finding Folkman Numbers via MAX CUT Problem (Q3503536) (← links)
- On the Folkman Number<i>f</i>(2, 3, 4) (Q3546252) (← links)
- A Note on Universal and Canonically Coloured Sequences (Q3552497) (← links)
- Cliques in Steiner systems (Q3601028) (← links)
- (Q4120179) (← links)
- Tight Hamilton cycles in random uniform hypergraphs (Q4921888) (← links)
- Large triangle packings and Tuza’s conjecture in sparse random graphs (Q4987259) (← links)
- On weak twins and up-and-down subpermutations (Q5096035) (← links)
- Powers of Hamiltonian cycles in randomly augmented graphs (Q5113934) (← links)
- Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process (Q5157383) (← links)
- Monochromatic loose paths in multicolored $k$-uniform cliques (Q5207843) (← links)
- Minimizing the number of 5-cycles in graphs with given edge-density (Q5222570) (← links)
- A Random Variant of the Game of Plates and Olives (Q5232149) (← links)
- Maker‐breaker games on random geometric graphs (Q5256385) (← links)
- On some Multicolor Ramsey Properties of Random Graphs (Q5357963) (← links)
- On the Size‐Ramsey Number of Hypergraphs (Q5360878) (← links)
- Loose Hamilton Cycles in Regular Hypergraphs (Q5364219) (← links)
- An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths (Q5364242) (← links)
- (Q5403005) (← links)
- (Q5420010) (← links)
- New Upper Bound on Vertex Folkman Numbers (Q5458552) (← links)
- On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs (Q5495882) (← links)
- High powers of Hamiltonian cycles in randomly augmented graphs (Q6056783) (← links)
- Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection (Q6062872) (← links)
- Long twins in random words (Q6065692) (← links)
- (Q6072063) (← links)
- Patterns in ordered (random) matchings (Q6109030) (← links)
- Square of Hamilton cycle in a random graph (Q6274932) (← links)
- Square of a Hamilton cycle in a random graph (Q6279945) (← links)
- Adding random edges to create the square of a Hamilton cycle (Q6292278) (← links)
- The Erd\H{o}s-Gy\'arf\'as function $f(n, 4, 5) = \frac 56 n + o(n)$ -- so Gy\'arf\'as was right (Q6404207) (← links)
- A note on non-isomorphic edge-color classes in random graphs (Q6412981) (← links)
- A random coloring process gives improved bounds for the Erd\H{o}s-Gy\'arf\'as problem on generalized Ramsey numbers (Q6420484) (← links)
- Erd\H{o}s-Szekeres type Theorems for ordered uniform matchings (Q6422835) (← links)
- Generalized Ramsey numbers at the linear and quadratic thresholds (Q6449439) (← links)
- Twins in ordered hyper-matchings (Q6453500) (← links)