scientific article; zbMATH DE number 4101221
From MaRDI portal
Publication:3826581
Cited in
(27)- On the order of the largest induced tree in a random graph
- Poisson convergence and Poisson processes with applications to random graphs
- Expose-and-merge exploration and the chromatic number of a random graph
- The jamming constant of uniform random graphs
- The resolution complexity of random graph \(k\)-colorability
- Coloring random graphs
- Coloring random graphs
- Randomly coloring random graphs
- Colouring Random Regular Graphs
- scientific article; zbMATH DE number 1962838 (Why is no real title available?)
- Randomly colouring graphs (a combinatorial view)
- Generalized random sequential adsorption on Erdős-Rényi random graphs
- The Markov chain of colourings
- Finding Pseudorandom Colorings of Pseudorandom Graphs
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
- Coloring Random Intersection Graphs and Complex Networks
- Approximation algorithms in combinatorial scientific computing
- Colouring Random 4-Regular Graphs
- Large deviations of the greedy independent set algorithm on sparse random graphs
- Random colorings in manifolds
- Near-optimal dominating sets in dense random graphs in polynomial expected time
- Greedy maximal independent sets via local limits
- Ultimate greedy approximation of independent sets in subcubic graphs
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs
- Scaling limits and generic bounds for exploration processes
- The average-case complexity of counting cliques in Erdős-Rényi hypergraphs
- Eidolon: a post-quantum signature scheme based on k-colorability in the age of graph neural networks
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 Q3826581)
