Results 31 to 40 of about 1,132 (55)
Extremal, enumerative and probabilistic results on ordered hypergraph matchings
Forum of Mathematics, SigmaAn ordered r-matching is an r-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of r-dimensional orders.
Michael Anastos +3 more
doaj +1 more source
Overgroups of the Automorphism Group of the Rado Graph
, 2012 We are interested in overgroups of the automorphism group of the Rado graph. One class of such overgroups is completely understood; this is the class of reducts.
Cameron, Peter +4 more
core +2 more sources
The rank of random regular digraphs of constant degree
, 2018 Let $d$ be a fixed large integer. For any $n$ larger than $d$, let $A_n$ be the adjacency matrix of the random directed $d$-regular graph on $n$ vertices, with the uniform distribution. We show that $A_n$ has rank at least $n-1$ with probability going to
Litvak, Alexander +4 more
core +2 more sources
Length spectrum of large genus random metric maps
Forum of Mathematics, SigmaWe study the length of short cycles on uniformly random metric maps (also known as ribbon graphs) of large genus using a Teichmüller theory approach.
Simon Barazer +2 more
doaj +1 more source
Mantel's Theorem for random graphs [PDF]
, 2012 For a graph $G$, denote by $t(G)$ (resp. $b(G)$) the maximum size of a triangle-free (resp. bipartite) subgraph of $G$. Of course $t(G) \geq b(G)$ for any $G$, and a classic result of Mantel from 1907 (the first case of Tur\'an's Theorem) says that ...
DeMarco, Bobby, Kahn, Jeff
core
The probability that a random multigraph is simple
, 2006 Consider a random multigraph G* with given vertex degrees d_1,...,d_n, contructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with the number of edges (d_1+...+d_n)/2 tending to infinity, the probability ...
Janson, Svante
core +2 more sources
Special issue on statistical analysis of networks: Preface by the guest editors. [PDF]
Stat Methods Appt, 2021 Schweinberger M, Stingo FC, Vitale MP.
europepmc +1 more source
Quasirandom Graphs and the Pantograph Equation. [PDF]
Am Math Mon, 2021 Shapira A, Tyomkyn M.
europepmc +1 more source
A note on the component structure in random intersection graphs with tunable clustering
, 2007 We study the component structure in random intersection graphs with tunable clustering, and show that the average degree works as a threshold for a phase transition for the size of the largest component.
Lagerås, Andreas Nordvall +1 more
core +3 more sources
Systemic cascades on inhomogeneous random financial networks. [PDF]
Math Financ Econ, 2023 Hurd TR.
europepmc +1 more source