The following pages link to John Haslegrave (Q383336):
Displaying 50 items.
- An evasion game on a graph (Q383337) (← links)
- Bounds on Herman's algorithm (Q401316) (← links)
- Extremal results on average subtree density of series-reduced trees (Q403359) (← links)
- Judicious partitions of uniform hypergraphs (Q484549) (← links)
- The robber locating game (Q501037) (← links)
- Majority dynamics with one nonconformist (Q505417) (← links)
- Three-speed ballistic annihilation: phase transition and universality (Q821033) (← links)
- Forcing large tight components in 3-graphs (Q1715624) (← links)
- Combinatorial universality in three-speed ballistic annihilation (Q1983064) (← links)
- Non-convergence of proportions of types in a preferential attachment graph with three co-existing types (Q1990021) (← links)
- A time-invariant random graph with splitting events (Q2078234) (← links)
- The path minimises the average size of a connected induced subgraph (Q2113349) (← links)
- Spanning surfaces in \(3\)-graphs (Q2119367) (← links)
- Degrees in link graphs of regular graphs (Q2138581) (← links)
- On the relationship between variable Wiener index and variable Szeged index (Q2152719) (← links)
- Locating a robber with multiple probes (Q2411615) (← links)
- The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs (Q2454588) (← links)
- Subdivisions in the robber locating game (Q2629293) (← links)
- Generalized spectral characterizations of regular graphs based on graph-vectors (Q2685385) (← links)
- Sum index, difference index and exclusive sum number of graphs (Q2698535) (← links)
- Proof of a local antimagic conjecture (Q4560242) (← links)
- Reaching consensus on a connected graph (Q4684846) (← links)
- Percolation on an infinitely generated group (Q4993107) (← links)
- Extremal density for sparse minors and subdivisions (Q5046072) (← links)
- Crux and Long Cycles in Graphs (Q5058129) (← links)
- Condensation in preferential attachment models with location‐based choice (Q5113955) (← links)
- Preferential attachment with choice (Q5740274) (← links)
- Choice and Bias in Random Walks (Q5875783) (← links)
- Ramsey numbers of cycles versus general graphs (Q5878545) (← links)
- The power of two choices for random walks (Q5886308) (← links)
- Determining triangulations and quadrangulations by boundary distances (Q6051053) (← links)
- When removing an independent set is optimal for reducing the chromatic number (Q6057453) (← links)
- Time Dependent Biased Random Walks (Q6058240) (← links)
- Site percolation and isoperimetric inequalities for plane graphs (Q6073625) (← links)
- The number and average size of connected sets in graphs with degree constraints (Q6081554) (← links)
- Monitoring edge-geodetic sets: hardness and graph products (Q6094715) (← links)
- Settling the nonorientable genus of the nearly complete bipartite graphs (Q6133666) (← links)
- Tight bounds on the chromatic edge stability index of graphs (Q6197718) (← links)
- Countable graphs are majority 3-choosable (Q6337266) (← links)
- Sum index, difference index and exclusive sum number of graphs (Q6365309) (← links)
- On the relationship between variable Wiener index and variable Szeged index (Q6374850) (← links)
- The extremal generalised Randi\'c index for a given degree range (Q6520065) (← links)
- Lower bounds for the Randi\'c index in terms of matching number (Q6522604) (← links)
- Balanced two-type annihilation: mean-field asymptotics (Q6529381) (← links)
- Dissipative particle systems on expanders (Q6529387) (← links)
- On the distance spectra of central vertex join and central edge join of two regular graphs (Q6601214) (← links)
- Extremal density for sparse minors and subdivisions (Q6604668) (← links)
- Boundary rigidity of 3D CAT(0) cube complexes (Q6655699) (← links)
- Random triangulations of the d-sphere with minimum volume (Q6742472) (← links)
- Stable cuts, NAC-colourings and flexible realisations of graphs (Q6759173) (← links)
