Maurício Collares

activity

20132025

most citedThe typical structure of graphs with no large cliques

4 citations · 10 across the 13 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

math.CO2014★ 4 cited

The typical structure of graphs with no large cliques

József Balogh, Neal Bushaw, Maurício Collares Neto +3

In 1987, Kolaitis, Prömel and Rothschild proved that, for every fixed $r \in N$ , almost every $n$ -vertex $K_{r + 1}$ -free graph is $r$ -partite. In this paper we extend this…

math.CO2014

Maximum-size antichains in random set-systems

Maurício Collares Neto, Robert Morris

We show that, for $p n \to \infty$ , the largest set in a $p$ -random sub-family of the power set of ${1, \dots, n}$ containing no $k$ -chain has size $( k - 1 + o(1) ) p \binom{n}{…