The following pages link to Bhargav P. Narayanan (Q402595):
Displayed 47 items.
- Exactly \(m\)-coloured complete infinite subgraphs (Q402596) (← links)
- Separating path systems (Q482277) (← links)
- On the stability of the Erdős-Ko-Rado theorem (Q889512) (← links)
- (Q1633759) (redirect page) (← links)
- The number of hypergraphs without linear cycles (Q1633760) (← links)
- The multiplication table problem for bipartite graphs (Q1669691) (← links)
- Diffusion on graphs is eventually periodic (Q1713784) (← links)
- Long cycles in Hamiltonian graphs (Q1717607) (← links)
- Thresholds versus fractional expectation-thresholds (Q1983096) (← links)
- Coppersmith's lattices and ``focus groups'': an attack on small-exponent RSA (Q1998906) (← links)
- Product-free sets in the free semigroup (Q2011128) (← links)
- A universal exponent for homeomorphs (Q2048857) (← links)
- Spanning surfaces in \(3\)-graphs (Q2119367) (← links)
- Exceptional graphs for the random walk (Q2227475) (← links)
- Counting independent sets in regular hypergraphs (Q2229168) (← links)
- Slowdown for the geodesic-biased random walk (Q2279090) (← links)
- Disjoint induced subgraphs of the same order and size (Q2349965) (← links)
- Catching a fast robber on the grid (Q2401986) (← links)
- Ramsey graphs induce subgraphs of many different sizes (Q2416519) (← links)
- Connections in Randomly Oriented Graphs (Q3177366) (← links)
- On regular 3-wise intersecting families (Q3177823) (← links)
- TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM (Q3449986) (← links)
- Approximations to <i>m</i>‐Colored Complete Infinite Hypergraphs (Q3466346) (← links)
- Line percolation (Q4584912) (← links)
- Induced Subgraphs With Many Distinct Degrees (Q4601057) (← links)
- Coalescence on the real line (Q4644942) (← links)
- Balancing sums of random vectors (Q4645029) (← links)
- The threshold for the square of a Hamilton cycle (Q4992907) (← links)
- Turán theorems for unavoidable patterns (Q5063194) (← links)
- Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs (Q5120748) (← links)
- Disproportionate division (Q5135364) (← links)
- An improved lower bound for Folkman's theorem (Q5357107) (← links)
- A Canonical Ramsey Theorem for Exactly <i>m</i>-Coloured Complete Subgraphs (Q5414149) (← links)
- Simplicial homeomorphs and trace-bounded hypergraphs (Q5871268) (← links)
- On symmetric intersecting families of vectors (Q5886116) (← links)
- Friendly bisections of random graphs (Q6052387) (← links)
- Down‐set thresholds (Q6076724) (← links)
- Subgraphs of large connectivity and chromatic number (Q6133373) (← links)
- Antichain codes (Q6139014) (← links)
- Reconstructing random jigsaws (Q6289034) (← links)
- Product-free sets in the free semigroup (Q6311046) (← links)
- Sharp estimates for spanning trees (Q6359674) (← links)
- Applications of Random Algebraic Constructions to Hardness of Approximation (Q6382648) (← links)
- A Counterexample to a Directed KKL Inequality (Q6412937) (← links)
- Reconstructing random pictures (Q6414242) (← links)
- Clique Supersaturation (Q6463431) (← links)
- Colouring random subgraphs (Q6463450) (← links)