Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

The number of descendants in a random directed acyclic graph: Label: en
Sharp thresholds in adaptive random graph processes: Label: en
Prominent examples of flip processes: Label: en
Counting orientations of random graphs with no directed k‐cycles: Label: en
Defective coloring of hypergraphs: Label: en
Coloring lines and Delaunay graphs with respect to boxes: Label: en
Rainbow subdivisions of cliques: Label: en
The Erlang weighted tree, a new branching process: Label: en
Optimal bisections of directed graphs: Label: en
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs: Label: en
A Ramsey–Turán theory for tilings in graphs: Label: en
Packing list‐colorings: Label: en
Subcritical monotone cellular automata: Label: en
Limit theorems for patterns in ranked tree‐child networks: Label: en
Random perfect matchings in regular graphs: Label: en
Spatial mixing and the random‐cluster dynamics on lattices: Label: en
On a rainbow extremal problem for color‐critical graphs: Label: en
The upper tail problem for induced 4‐cycles in sparse random graphs: Label: en
A down‐up chain with persistent labels on multifurcating trees: Label: en
A full characterization of invariant embeddability of unimodular planar graphs: Label: en
Expansion of random 0/1 polytopes: Label: en
Extremal results on feedback arc sets in digraphs: Label: en
Universality of superconcentration in the Sherrington–Kirkpatrick model: Label: en
The birth of the strong components: Label: en
A lower bound for set‐coloring Ramsey numbers: Label: en
Quasirandom Latin squares: Label: en
Epidemics on networks with preventive rewiring: Label: en
Tuza's conjecture for random graphs: Label: en
Independence number of hypergraphs under degree conditions: Label: en
Moderate deviations in cycle count: Label: en
Matchings on trees and the adjacency matrix: A determinantal viewpoint: Label: en
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel: Label: en
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree: Label: en
Natural quasirandomness properties: Label: en
Hypergraph Ramsey numbers of cliques versus stars: Label: en
On powers of tight Hamilton cycles in randomly perturbed hypergraphs: Label: en
The spectral gap of random regular graphs: Label: en
Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes: Label: en
Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees: Label: en
Down‐set thresholds: Label: en
Site percolation on pseudo‐random graphs: Label: en
Broadcasting‐induced colorings of preferential attachment trees: Label: en
Kemeny's constant for nonbacktracking random walks: Label: en
Clustering and percolation on superpositions of Bernoulli random graphs: Label: en
Iterated tour partitioning for Euclidean capacitated vehicle routing: Label: en
Asymmetric Ramsey properties of random graphs involving cliques and cycles: Label: en
The jump of the clique chromatic number of random graphs: Label: en
Hypergraph regularity and random sampling: Label: en
The number of perfect matchings, and the nesting properties, of random regular graphs: Label: en
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity: Label: en