The following pages link to Andrzej Dudek (Q267203):
Displaying 50 items.
- The vertex size-Ramsey number (Q267205) (← links)
- (Q323037) (redirect page) (← links)
- The set chromatic number of random graphs (Q323038) (← links)
- On the Ramsey-Turán number with small \(s\)-independence number (Q345117) (← links)
- Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity (Q345119) (← links)
- On minimum saturated matrices (Q367048) (← links)
- Some recent results on Ramsey-type numbers (Q385143) (← links)
- (Q409378) (redirect page) (← links)
- On the maximum number of edges in a hypergraph with a unique perfect matching (Q409380) (← links)
- On the size and structure of graphs with a constant number of 1-factors (Q418889) (← links)
- Rainbow Hamilton cycles in uniform hypergraphs (Q426813) (← links)
- Some remarks on vertex Folkman numbers for hypergraphs (Q449143) (← links)
- On generalized Ramsey numbers of Erdős and Rogers (Q462933) (← links)
- (Q540024) (redirect page) (← links)
- Loose Hamilton cycles in random uniform hypergraphs (Q540025) (← links)
- On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers (Q653983) (← links)
- The \(t\)-tone chromatic number of random graphs (Q742618) (← links)
- A note on a Ramsey-type problem for sequences (Q743660) (← links)
- Tight multiple twins in permutations (Q825967) (← links)
- An almost quadratic bound on vertex Folkman numbers (Q965241) (← links)
- Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence (Q965817) (← links)
- On \(k\)-partite hypergraphs with the induced \(\epsilon \)-density property (Q968427) (← links)
- On the Turán properties of infinite graphs (Q1010760) (← links)
- On \(k\)-chromatically connected graphs (Q1045036) (← links)
- Large monochromatic components and long monochromatic cycles in random hypergraphs (Q1633610) (← links)
- On rainbow Hamilton cycles in random hypergraphs (Q1648665) (← links)
- Note on the multicolour size-Ramsey number for paths (Q1671658) (← links)
- On offset Hamilton cycles in random hypergraphs (Q1701116) (← links)
- A note on the localization number of random graphs: diameter two case (Q1720315) (← links)
- Randomly twisted hypercubes (Q1746591) (← links)
- Size-Ramsey numbers of cycles versus a path (Q1752689) (← links)
- Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs (Q1953356) (← links)
- On the number of alternating paths in bipartite complete graphs (Q2014212) (← links)
- Variations on twins in permutations (Q2048547) (← links)
- Localization game for random graphs (Q2065786) (← links)
- An analogue of the Erdős-Gallai theorem for random graphs (Q2225403) (← links)
- Hat chromatic number of graphs (Q2231730) (← links)
- On the number of alternating paths in random graphs (Q2231749) (← links)
- Constructive Ramsey numbers for loose hyperpaths (Q2294702) (← links)
- Extensions of results on rainbow Hamilton cycles in uniform hypergraphs (Q2345522) (← links)
- On balanced colorings of sparse hypergraphs (Q2439128) (← links)
- Approximate counting of regular hypergraphs (Q2445249) (← links)
- Cops and robbers playing on edges (Q2448255) (← links)
- Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs (Q2629488) (← links)
- The total acquisition number of random graphs (Q2629497) (← links)
- A gentle introduction to the differential equation method and dynamic concentration (Q2675831) (← links)
- Acquaintance Time of Random Graphs Near Connectivity Threshold (Q2801332) (← links)
- On induced Folkman numbers (Q2904596) (← links)
- Flips in Graphs (Q3008026) (← links)
- On the Function of Erdős and Rogers (Q3064178) (← links)
