The following pages link to Fabrício Siqueira Benevides (Q777473):
Displaying 13 items.
- (Q396749) (redirect page) (← links)
- On slowly percolating sets of minimal size in bootstrap percolation (Q396751) (← links)
- The number of Gallai \(k\)-colorings of complete graphs (Q777474) (← links)
- (Q1026010) (redirect page) (← links)
- The 3-colored Ramsey number of even cycles (Q1026011) (← links)
- Maximizing the expected number of components in an online search of a graph (Q2237242) (← links)
- Counting Gallai 3-colorings of complete graphs (Q2312802) (← links)
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring (Q2359958) (← links)
- Identifying defective sets using queries of small size (Q2411609) (← links)
- Additive properties of a pair of sequences (Q3184345) (← links)
- A multipartite Ramsey number for odd cycles (Q4650183) (← links)
- Percolation and best-choice problem for powers of paths (Q4684858) (← links)
- Heilbronn triangle‐type problems in the unit square [0,1]<sup>2</sup> (Q6074876) (← links)
