Sharp Threshold for Cliques in Random 0/1 Polytope Graphs
From MaRDI portal
Structural characterization of families of graphs (05C75) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial probability (60C05)
This page was built for publication: Sharp Threshold for Cliques in Random 0/1 Polytope Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7183654)