Strongly balanced graphs and random graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(40)- Transforming a graph into a 1-balanced graph
- When are small subgraphs of a random graph normally distributed?
- On strongly balanced 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
- Threshold functions for small subgraphs: an analytic approach
- Every matroid is a submatroid of a uniformly dense matroid
- Edge-disjoint spanning trees and forests of graphs
- Large cycles in random generalized Johnson graphs
- Zero-one laws for random \(k\)-partite graphs
- Strictly balanced uniform hypergraphs and generalizations of zero-one law
- Threshold functions for small subgraphs in simple graphs and multigraphs
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
- Jumps in speeds of hereditary properties in finite relational languages
- Connected balanced subgraphs in random regular multigraphs under the configuration model
- scientific article; zbMATH DE number 3889584 (Why is no real title available?)
- Universal zero-one k-law
- scientific article; zbMATH DE number 3865331 (Why is no real title available?)
- scientific article; zbMATH DE number 4041966 (Why is no real title available?)
- scientific article; zbMATH DE number 568785 (Why is no real title available?)
- scientific article; zbMATH DE number 701118 (Why is no real title available?)
- Infinitary logics and very sparse random graphs
- Characteristic dependence of syzygies of random monomial ideals
- First-order zero-one law for the uniform model of the random graph
- Counting extensions revisited
- Balanced and 1-balanced graph constructions
- Cyclic base ordering of generalized Petersen graphs
- Cyclic base ordering of certain degenerate graphs
- Universality for graphs with bounded density
- Destroying densest subgraphs is hard
- Normal to Poisson phase transition for subgraph counting in the random-connection model
- First order distinguishability of sparse random graphs
- Sharp thresholds in inference of planted subgraphs
- Destroying densest subgraphs is hard
- Modulus for bases of matroids
- Detection of dense subhypergraphs by low-degree polynomials
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
- Balanced extensions of graphs and hypergraphs
- On the spectra of first-order language properties for random graphs
This page was built for publication: Strongly balanced graphs and random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3795707)
