Search Results - "Collares, Mauricio"

Counting orientations of random graphs with no directed k‐cycles by Campos, Marcelo, Collares, Maurício, Mota, Guilherme Oliveira

“…For every k⩾3$$ k\geqslant 3 $$, we determine the order of growth, up to polylogarithmic factors, of the number of orientations of the binomial random graph…”
Get full text

The diameter of randomly twisted hypercubes by Aragão, Lucas, Collares, Maurício, Dahia, Gabriel, Marciano, João Pedro

“…The n-dimensional random twisted hypercube Gn is constructed recursively by taking two instances of Gn−1, with any joint distribution, and adding a random…”
Get full text

Maximum-size antichains in random set-systems by Collares, Maurício, Morris, Robert

“…We show that, for pn→∞, the largest set in a p‐random sub‐family of the power set of {1,…,n} containing no k‐chain has size (k−1+o(1))p(nn/2) with high…”
Get full text

The Typical Structure of Sets With Small Sumset by Campos, Marcelo, Collares, Maurício, Morris, Robert, Morrison, Natasha, Souza, Victor

“…Abstract In this paper we determine the number and typical structure of sets of integers with bounded doubling. In particular, improving recent results of…”
Get full text

A lower bound for set‐coloring Ramsey numbers by Aragão, Lucas, Collares, Maurício, Marciano, João Pedro, Martins, Taísa, Morris, Robert

“…The set‐coloring Ramsey number Rr,s(k)$$ {R}_{r,s}(k) $$ is defined to be the minimum n$$ n $$ such that if each edge of the complete graph Kn$$ {K}_n $$ is…”
Get full text

Counting restricted orientations of random graphs by Collares, Maurício, Kohayakawa, Yoshiharu, Morris, Robert, Mota, Guilherme O.

“…We count orientations of G(n,p) avoiding certain classes of oriented graphs. In particular, we study Tr(n,p), the number of orientations of the binomial random…”
Get full text

The typical structure of graphs with no large cliques by Balogh, József, Bushaw, Neal, Collares, Maurício, Liu, Hong, Morris, Robert, Sharifzadeh, Maryam

“…In 1987, Kolaitis, Prömel and Rothschild proved that, for every fixed r ∈ℕ, almost every n -vertex K r +1 -free graph is r -partite. In this paper we extend…”
Get full text

Health-Related Quality of Life Outcomes in Head and Neck Cancer: Results From a Prospective, Real-World Data Study With Brazilian Patients Treated With Intensity Modulated Radiation Therapy, Conformal and Conventional Radiation Techniques by Santos, Marcos, Oliveira e Silva, Luís Felipe, Kohler, Hugo F., Curioni, Otavio, Vilela, Ricardo, Fang, Marcel, Passos Lima, Carmen Silvia, Gomes, João Pedro, Chaves, Aline, Resende, Bruno, Trindade, Karine, Collares, Mauricio, Obs, Fernando, Brollo, Janaina, Cavalieri, Ronaldo, Ferreira, Ediane, Brust, Leandro, Rabello, Doralina, Domenge, Christian, Kowalski, Luiz Paulo

“…To compare global health-related quality of life (HRQoL) and overall survival (OS) in patients with head and neck cancer treated with intensity modulated…”
Get full text

The sharp threshold for maximum-size sum-free subsets in even-order abelian groups by Bushaw, Neal, Neto, Maurício Collares, Morris, Robert, Smith, Paul

“…Combinator. Probab. Comp. 24 (2015) 609-640 We study sum-free sets in sparse random subsets of even order abelian groups. In particular, we determine the sharp…”
Get full text

The evolution of the permutahedron by Collares, Maurício, Doolittle, Joseph, Erde, Joshua

“…In their seminal paper introducing the theory of random graphs, Erd\H{o}s and R\'{e}nyi considered the evolution of the structure of a random subgraph of $K_n$…”
Get full text

Long cycles in percolated expanders by Collares, Maurício, Diskin, Sahar, Erde, Joshua, Krivelevich, Michael

“…Given a graph $G$ and probability $p$, we form the random subgraph $G_p$ by retaining each edge of $G$ independently with probability $p$. Given…”
Get full text

Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs by Collares, Maurício, Erde, Joshua, Geisler, Anna, Kang, Mihyun

“…Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially…”
Get full text

Counting orientations of random graphs with no directed k-cycles by Campos, Marcelo, Collares, Maurício, Mota, Guilherme Oliveira

“…For every $k \geq 3$, we determine the order of growth, up to polylogarithmic factors, of the number of orientations of the binomial random graph containing no…”
Get full text

The diameter of randomly twisted hypercubes by Aragão, Lucas, Collares, Maurício, Dahia, Gabriel, Marciano, João Pedro

“…European J. Combin. 124 (2025) 104078 The $n$-dimensional random twisted hypercube $\mathbf{G}_n$ is constructed recursively by taking two instances of…”
Get full text

The threshold for the constrained Ramsey property by Collares, Maurício, Kohayakawa, Yoshiharu, Moreira, Carlos Gustavo, Mota, Guilherme Oliveira

“…Given graphs $G$, $H_1$, and $H_2$, let $G\xrightarrow{\text{mr}}(H_1,H_2)$ denote the property that in every edge colouring of $G$ there is a monochromatic…”
Get full text

A lower bound for set-colouring Ramsey numbers by Aragão, Lucas, Collares, Maurício, Marciano, João Pedro, Martins, Taísa, Morris, Robert

“…The set-colouring Ramsey number $R_{r,s}(k)$ is defined to be the minimum $n$ such that if each edge of the complete graph $K_n$ is assigned a set of $s$…”
Get full text

The Typical Structure of Sets with Small Sumset by Campos, Marcelo, Collares, Maurício, Morris, Robert, Morrison, Natasha, Souza, Victor

“…In this paper we determine the number and typical structure of sets of integers with bounded doubling. In particular, improving recent results of Green and…”
Get full text

Counting restricted orientations of random graphs by Collares, Maurício, Kohayakawa, Yoshiharu, Morris, Robert, Mota, Guilherme Oliveira

“…We count orientations of $G(n,p)$ avoiding certain classes of oriented graphs. In particular, we study $T_r(n,p)$, the number of orientations of the binomial…”
Get full text

Maximum-size antichains in random set-systems by Neto, Maurício Collares, Morris, Robert

“…We show that, for $pn \to \infty$, the largest set in a $p$-random sub-family of the power set of $\{1, \ldots, n\}$ containing no $k$-chain has size $( k - 1…”
Get full text

The typical structure of graphs with no large cliques by Balogh, József, Bushaw, Neal, Neto, Maurício Collares, Liu, Hong, Morris, Robert, Sharifzadeh, Maryam

“…In 1987, Kolaitis, Pr\"omel and Rothschild proved that, for every fixed $r \in \mathbb{N}$, almost every $n$-vertex $K_{r+1}$-free graph is $r$-partite. In…”
Get full text