3 citations · 6 across the 4 of their papers we have counts for
5 papers
Random Uniform and Pure Random Simplicial Complexes
Klas Markström, Trevor Pinto
In this paper we introduce a method which allows us to study properties of the random uniform simplicial complex. That is, we assign equal probability to all simplicial complexes w…
The -free process in the hypercube
J. Robert Johnson, Trevor Pinto
The generation of a random triangle-saturated graph via the triangle-free process has been studied extensively. In this short note our aim is to introduce an analogous process in t…
The proofs of two directed paths conjectures of Bollobás and Leader
Trevor Pinto
Let and be disjoint sets, of size , of vertices of , the -dimensional hypercube. In 1997, Bollobás and Leader proved that there must be edge-disjoin…
Saturated Subgraphs of the Hypercube
J. Robert Johnson, Trevor Pinto
We say is \emph{-saturated} if it is a maximal -free subgraph of the -dimensional hypercube . A graph, , is said to be -semi-saturated if…
Biclique Covers and Partitions
Trevor Pinto
The biclique cover number (resp. biclique partition number) of a graph , ) (resp. ), is the least number of biclique (complete bipartite) subgraph…