16 citations · 35 across the 9 of their papers we have counts for
10 papers · 1 filter
Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
F. Botler, Y. S. Couto, C. G. Fernandes +4
Chernyshev, Rauch, and Rautenbach proved that every connected graph on vertices with less than edges has a vertex cut that induces a forest, and co…
Flag Algebras: A First Glance
Marcel K. de Carli Silva, Fernando Mário de Oliveira Filho, Cristiane Maria Sato
The theory of flag algebras, introduced by Razborov in 2007, has opened the way to a systematic approach to the development of computer-assisted proofs in extremal combinatorics. I…
Packing arborescences in random digraphs
Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato
We study the problem of packing arborescences in the random digraph , where each possible arc is included uniformly at random with probability . Let $λ(\ma…
On the maximum density of fixed strongly connected subtournaments
Leonardo N. Coregliano, Roberto F. Parente, Cristiane M. Sato
We study the density of fixed strongly connected subtournaments on 5 vertices in large tournaments. We determine the maximum density asymptotically for five tournaments as well as…
Asymptotic enumeration of sparse connected 3-uniform hypergraphs
Cristiane M. Sato, Nick Wormald
We derive an asymptotic formula for the number of connected 3-uniform hypergraphs with vertex set and edges for as long as satisfies and $R=ω(N^{…
A transition of limiting distributions of large matchings in random graphs
Pu Gao, Cristiane M. Sato
We study the asymptotic distribution of the number of matchings of size in for a wide range of and for every $1\le \ell\le \lfloor n/2\rfl…
On the Longest Paths and the Diameter in Random Apollonian Networks
Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao +4
We consider the following iterative construction of a random planar triangulation. Start with a triangle embedded in the plane. In each step, choose a bounded face uniformly at ran…
Arboricity and spanning-tree packing in random graphs with an application to load balancing
Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato
We study the arboricity A and the maximum number T of edge-disjoint spanning trees of the Erdos-Renyi random graph G(n,p). For all p(n) in [0,1], we show that, with high probabilit…
On the robustness of random k-cores
Cristiane M. Sato
The k-core of a graph is its maximal subgraph with minimum degree at least k. In this paper, we address robustness questions about k-cores. Given a k-core, remove one edge uniforml…
Asymptotic enumeration of sparse 2-connected graphs
Graeme Kemkes, Cristiane M. Sato, Nicholas Wormald
We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on vertices and edges, provided that and as $n\to\in…