The following pages link to Anthony Bonato (Q189716):
Displayed 50 items.
- A probabilistic version of the game of zombies and survivors on graphs (Q343921) (← links)
- Lazy cops and robbers played on random graphs and graphs on surfaces (Q344444) (← links)
- Independence densities of hypergraphs (Q402469) (← links)
- Almost all cop-win graphs contain a universal vertex (Q418869) (← links)
- Fighting constrained fires in graphs (Q428868) (← links)
- Independence and chromatic densities of graphs (Q446006) (← links)
- Cops and robbers ordinals of cop-win trees (Q512565) (← links)
- Distinguishing number and adjacency properties (Q543989) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Twins of rayless graphs (Q618035) (← links)
- Infinite random geometric graphs (Q659653) (← links)
- The iterated local model for social networks (Q777439) (← links)
- Mutually embeddable graphs and the tree alternative conjecture (Q859614) (← links)
- All countable monoids embed into the monoid of the infinite random graph (Q960939) (← links)
- The good, the bad, and the great: homomorphisms and cores of random graphs (Q1045034) (← links)
- The capture time of a graph (Q1045043) (← links)
- The model companion of width-two orders (Q1267599) (← links)
- Homomorphisms and amalgamation (Q1406546) (← links)
- The monoid of the random graph (Q1576305) (← links)
- Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property (Q1591740) (← links)
- A family of universal pseudo-homogeneous \(G\)-colourable graphs (Q1598787) (← links)
- On retracts of the random graph and their natural order (Q1599507) (← links)
- Generalized pigeonhole properties of graphs and oriented graphs (Q1612756) (← links)
- The robot crawler graph process (Q1671307) (← links)
- Bounds on the burning number (Q1682876) (← links)
- (Q1882140) (redirect page) (← links)
- On a problem of Cameron's on inexhaustible graphs (Q1882142) (← links)
- A note on orientations of the infinite random graph (Q1883602) (← links)
- Meyniel's conjecture on the cop number: a survey (Q1937358) (← links)
- The capture time of the hypercube (Q1953506) (← links)
- Continuum many universal Horn classes of graphs of bounded chromatic number (Q1966155) (← links)
- The game of cops and eternal robbers (Q2034413) (← links)
- Improved bounds for burning fence graphs (Q2053737) (← links)
- Optimizing the trade-off between number of cops and capture time in cops and robbers (Q2073651) (← links)
- Probabilistically faulty searching on a half-line (extended abstract) (Q2081614) (← links)
- Distinguishing number of universal homogeneous Urysohn metric spaces (Q2088703) (← links)
- The localization capture time of a graph (Q2118876) (← links)
- Burning the plane. Densities of the infinite Cartesian grid (Q2227973) (← links)
- Approximation algorithms for graph burning (Q2327458) (← links)
- Bounds on the burning numbers of spiders and path-forests (Q2328861) (← links)
- Topological directions in cops and robbers (Q2335907) (← links)
- The game of overprescribed Cops and Robbers played on graphs (Q2409518) (← links)
- Burning a graph is hard (Q2410223) (← links)
- Geometric random graphs and Rado sets in sequence spaces (Q2422226) (← links)
- Sketchy tweets: ten minute conjectures in graph theory (Q2429454) (← links)
- On an adjacency property of almost all tournaments (Q2433700) (← links)
- Graphs with the \(n\)-e.c. adjacency property constructed from affine planes (Q2470461) (← links)
- Pursuit-evasion games on Latin square graphs (Q2699856) (← links)
- Metrically Universal Generic Structures in Free Amalgamation Classes (Q2720319) (← links)
- (Q2747185) (← links)