scientific article; zbMATH DE number 3943863
From MaRDI portal
Publication:3715148
Recommendations
Cited in
(44)- On the order of the largest induced tree in a random graph
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- On the connectivity of random subsets of projective spaces
- Turán's theorem and maximal degrees
- Solution methods and computational investigations for the linear bottleneck assignment problem
- The symmetry in the martingale inequality
- Integral homology of random simplicial complexes
- Evolution of a modified binomial random graph by agglomeration
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- Integer sets with prescribed pairwise differences being distinct
- Phase transition in cohomology groups of non-uniform random simplicial complexes
- Connectivity of the linear uniform hypergraph process
- Random graph's Hamiltonicity is strongly tied to its minimum degree
- On the strength of connectedness of a random hypergraph
- Perfect fractional matchings in \(k\)-out hypergraphs
- On resilience of connectivity in the evolution of random graphs
- Computational study of the US stock market evolution: a rank correlation-based network model
- Threshold and hitting time for high-order connectedness in random hypergraphs
- Concentration of rainbow \(k\)-connectivity of a multiplex random graph
- Asymptotics for Shamir's problem
- Evolution of high-order connected components in random hypergraphs
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
- The Kőnig graph process
- Short vertex disjoint paths and multiconnectivity in random graphs: reliable network computing
- Hitting times for Shamir's problem
- The random linear bottleneck assignment problem
- The sharp threshold for jigsaw percolation in random graphs
- Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
- Asymptotically optimal induced universal graphs
- Using tabu search techniques for graph coloring
- The chromatic number of random graphs
- Algebraic and combinatorial expansion in random simplicial complexes
- ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs
- Sharp threshold for rigidity of random graphs
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- The hitting time of clique factors
- Cohomology groups of non-uniform random simplicial complexes
- Building graphs with high minimum degree on a budget
- The hitting time of clique factors (extended abstract)
- Minimum degree k and k-connectedness usually arrive together
- Hamiltonicity of random subgraphs of the hypercube
- Maximum generic nullity of a graph
- Survival time of a random graph
- Expected values of parameters associated with the minimum rank of a graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3715148)
