The following pages link to (Q4116466):
Displaying 34 items.
- Some recent results on Ramsey-type numbers (Q385143) (← links)
- Some remarks on vertex Folkman numbers for hypergraphs (Q449143) (← links)
- On forbidden subdivision characterizations of graph classes (Q925035) (← links)
- Partitions of finite relational and set systems (Q1239324) (← links)
- The complexity of a class of infinite graphs (Q1323483) (← links)
- A scaling limit for the length of the longest cycle in a sparse random graph (Q1998764) (← links)
- Barak-Erdős graphs and the infinite-bin model (Q2077352) (← links)
- Progress on local properties problems of difference sets (Q2107491) (← links)
- Two graph theoretical problems (Q2227761) (← links)
- Generalized Ramsey numbers: forbidding paths with few colors (Q2309212) (← links)
- An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\) (Q2327227) (← links)
- A path Turán problem for infinite graphs (Q2374174) (← links)
- Remarks on the Erdős-Haynal problem and on the Bell numbers (Q2737536) (← links)
- On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$ (Q3300687) (← links)
- Finding Folkman Numbers via MAX CUT Problem (Q3503536) (← links)
- (Q3972097) (← links)
- A (5,5)-Colouring of <i>K</i><sub><i>n</i></sub> with Few Colours (Q4554774) (← links)
- (Q4718195) (← links)
- Local Properties via Color Energy Graphs and Forbidden Configurations (Q5208745) (← links)
- (Q5746636) (← links)
- New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers (Q5885201) (← links)
- Ramsey-type numbers involving graphs and hypergraphs with large girth (Q5886107) (← links)
- Induced Ramsey-type theorems (Q5900433) (← links)
- A note on long cycles in sparse random graphs (Q6042104) (← links)
- Lower bounds on the Erdős–Gyárfás problem via color energy graphs (Q6074587) (← links)
- Rainbow trees in uniformly edge‐colored graphs (Q6074865) (← links)
- The Erdős–Gyárfás function with respect to Gallai‐colorings (Q6081587) (← links)
- Edge-colouring graphs with local list sizes (Q6187343) (← links)
- New bounds on the generalized Ramsey number \(f(n, 5, 8)\) (Q6542039) (← links)
- On locally rainbow colourings (Q6615751) (← links)
- The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right (Q6615756) (← links)
- Asymptotically good local list edge colourings (Q6621166) (← links)
- Ramsey theory constructions from hypergraph matchings (Q6621271) (← links)
- Growth rates of the bipartite Erdős-Gyárfás function (Q6642509) (← links)
