Strongly balanced graphs and random graphs
From MaRDI portal
Publication:3795707
DOI10.1002/jgt.3190100214zbMath0651.05057OpenAlexW2033968656MaRDI QIDQ3795707
Andrew Vince, Andrzej Ruciński
Publication date: 1986
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190100214
Related Items (22)
Strictly balanced uniform hypergraphs and generalizations of zero-one law ⋮ When are small subgraphs of a random graph normally distributed? ⋮ Characteristic Dependence of Syzygies of Random Monomial Ideals ⋮ Universal zero-one \(k\)-law ⋮ Every matroid is a submatroid of a uniformly dense matroid ⋮ Balanced and 1-balanced graph constructions ⋮ Jumps in speeds of hereditary properties in finite relational languages ⋮ On the spectra of first-order language properties for random graphs ⋮ Threshold functions for small subgraphs in simple graphs and multigraphs ⋮ Threshold functions for small subgraphs: an analytic approach ⋮ First-order zero-one law for the uniform model of the random graph ⋮ Infinitary logics and very sparse random graphs ⋮ Convex hulls of dense balanced graphs ⋮ Matching and covering the vertices of a random graph by copies of a given graph ⋮ Fractional arboricity, strength, and principal partitions in graphs and matroids ⋮ Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid ⋮ Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting ⋮ Edge-disjoint spanning trees and forests of graphs ⋮ Transforming a graph into a 1-balanced graph ⋮ Large cycles in random generalized Johnson graphs ⋮ Zero-one laws for random \(k\)-partite graphs ⋮ Balanced extensions of graphs and hypergraphs
Cites Work
This page was built for publication: Strongly balanced graphs and random graphs
