Anthony Bonato

From MaRDI portal
Person:189716

Available identifiers

zbMath Open bonato.anthonyWikidataQ102246796 ScholiaQ102246796MaRDI QIDQ189716

List of research outcomes

PublicationDate of PublicationType
Improved pyrotechnics: closer to the burning number conjecture2024-02-16Paper
The localization number of designs2024-02-01Paper
The $k$-visibility Localization Game2023-11-02Paper
The one-visibility localization game2023-10-12Paper
The iterated local transitivity model for tournaments2023-10-04Paper
Algorithms for \(p\)-Faulty Search on a half-line2023-08-17Paper
An evolving network model from clique extension2023-08-10Paper
The localization game on oriented graphs2023-08-02Paper
https://portal.mardi4nfdi.de/entity/Q61654872023-08-01Paper
The iterated local transitivity model for hypergraphs2023-06-15Paper
Pursuit-evasion games on Latin square graphs2023-04-19Paper
Dynamic Competition Networks: Detecting Alliances and Leaders2023-03-09Paper
Asymptotics of multicomponent linked polygons2023-02-07Paper
Asymptotics of linked polygons2023-01-23Paper
Common Adversaries Form Alliances: Modelling Complex Networks via Anti-transitivity2022-11-04Paper
The game of flipping coins2022-10-14Paper
The Iterated Local Directed Transitivity Model for Social Networks2022-10-14Paper
Iterated Global Models for Complex Networks2022-10-14Paper
Probabilistically faulty searching on a half-line (extended abstract)2022-10-13Paper
Distinguishing number of universal homogeneous Urysohn metric spaces2022-10-06Paper
https://portal.mardi4nfdi.de/entity/Q50994282022-08-31Paper
https://portal.mardi4nfdi.de/entity/Q50994292022-08-31Paper
https://portal.mardi4nfdi.de/entity/Q50994302022-08-31Paper
An Invitation to Pursuit-Evasion Games and Graph Theory2022-07-18Paper
Bounds on the localization number2022-03-31Paper
https://portal.mardi4nfdi.de/entity/Q33907112022-03-25Paper
The localization capture time of a graph2022-03-23Paper
Optimizing the trade-off between number of cops and capture time in cops and robbers2022-02-03Paper
On Meyniel extremal families of graphs2022-01-21Paper
Improved bounds for burning fence graphs2021-11-30Paper
An improved bound on the burning number of graphs2021-10-03Paper
Pursuit-evasion games on latin square graphs2021-09-29Paper
Geometric random graphs and Rado sets of continuous functions2021-09-20Paper
Spaces for All: The Rise of LGBTQ+ Mathematics Conferences2021-08-12Paper
The game of cops and eternal robbers2021-06-22Paper
The localization capture time of a graph2021-05-20Paper
A survey of graph burning2021-04-27Paper
How to Burn a Graph2021-03-26Paper
Progress on the localization number of a graph2021-03-18Paper
Burning the plane. Densities of the infinite Cartesian grid2021-02-16Paper
The iterated local model for social networks2020-07-07Paper
The Game of Cops and Eternal Robbers2020-03-08Paper
Topological directions in cops and robbers2019-11-18Paper
Bounds on the burning numbers of spiders and path-forests2019-10-16Paper
Approximation algorithms for graph burning2019-10-15Paper
Pursuit and evasion from a distance: algorithms and bounds2019-09-16Paper
Geometric random graphs and Rado sets in sequence spaces2019-06-18Paper
A Sublinear Bound on the Cop Throttling Number of a Graph2019-01-25Paper
https://portal.mardi4nfdi.de/entity/Q45615882018-12-07Paper
Distinguishing number of Urysohn metric spaces2018-11-14Paper
Approximation Algorithms for Graph Burning2018-11-11Paper
The robot crawler graph process2018-09-06Paper
https://portal.mardi4nfdi.de/entity/Q45838752018-09-03Paper
Characterizations and algorithms for generalized Cops and Robbers games2017-12-20Paper
Bounds on the burning number2017-12-06Paper
Burning a graph is hard2017-10-17Paper
The game of overprescribed Cops and Robbers played on graphs2017-10-11Paper
Lazy Cops and Robbers on Hypercubes2017-10-04Paper
Graph Searching Games and Probabilistic Methods2017-09-19Paper
Cops and robbers ordinals of cop-win trees2017-02-27Paper
Infinite random graphs and properties of metrics2017-01-25Paper
Conjectures on Cops and Robbers2016-12-16Paper
A probabilistic version of the game of zombies and survivors on graphs2016-11-29Paper
Lazy cops and robbers played on random graphs and graphs on surfaces2016-11-22Paper
https://portal.mardi4nfdi.de/entity/Q28160602016-07-01Paper
The Robot Crawler Number of a Graph2016-01-08Paper
The Domination Number of On-line Social Networks and Random Geometric Graphs2015-09-30Paper
Burning a Graph as a Model of Social Contagion2015-09-09Paper
Distinguishing homomorphisms of infinite graphs2015-08-05Paper
On the minimum order of k-cop-win graphs2015-08-05Paper
A note on bounds for the cop number using tree decompositions2015-08-05Paper
https://portal.mardi4nfdi.de/entity/Q52654082015-07-24Paper
Toppling numbers of complete and random graphs2015-02-09Paper
Independence densities of hypergraphs2014-08-28Paper
Infinite Random Geometric Graphs from the Hexagonal Metric2014-08-19Paper
https://portal.mardi4nfdi.de/entity/Q51700482014-07-17Paper
WHAT IS...Cop Number?2014-04-15Paper
Cops and Robbers on Graphs Based on Designs2013-11-26Paper
Properties of metrics and infinite geometric graphs2013-10-17Paper
Vertex-Pursuit in Random Directed Acyclic Graphs2013-09-26Paper
The robber strikes back2013-08-13Paper
The capture time of the hypercube2013-06-07Paper
Meyniel's conjecture on the cop number: a survey2013-02-28Paper
Geometric Protean Graphs2012-08-29Paper
Independence and chromatic densities of graphs2012-08-28Paper
Vertex-Pursuit in Hierarchical Social Networks2012-07-16Paper
Fighting constrained fires in graphs2012-06-25Paper
Almost all cop-win graphs contain a universal vertex2012-05-30Paper
Sketchy tweets: ten minute conjectures in graph theory2012-04-27Paper
Models of Online Social Networks2012-04-18Paper
Infinite random geometric graphs2012-01-24Paper
https://portal.mardi4nfdi.de/entity/Q30909342011-09-07Paper
Infinite Limits and Adjacency Properties of a Generalized Copying Model2011-06-21Paper
Distinguishing number and adjacency properties2011-06-14Paper
Infinite Limits and Adjacency Properties of a Generalized Copying Model2011-02-28Paper
Pursuit-Evasion in Models of Complex Networks2011-02-28Paper
Open Letter to the Internet Mathematics Community2011-02-28Paper
A Spatial Web Graph Model with Local Influence Regions2011-02-28Paper
The Geometric Protean Model for On-Line Social Networks2011-01-21Paper
Twins of rayless graphs2011-01-14Paper
Large classes of infinite k-cop-win graphs2010-12-14Paper
Cops and robbers from a distance2010-11-11Paper
https://portal.mardi4nfdi.de/entity/Q35766932010-07-30Paper
Graphs with then-e.c. adjacency property constructed from resolvable designs2010-07-13Paper
https://portal.mardi4nfdi.de/entity/Q35586032010-05-05Paper
https://portal.mardi4nfdi.de/entity/Q35586372010-05-05Paper
All countable monoids embed into the monoid of the infinite random graph2010-03-29Paper
The good, the bad, and the great: homomorphisms and cores of random graphs2009-12-15Paper
The capture time of a graph2009-12-15Paper
Then-ordered graphs: A new graph class2009-03-04Paper
A note on domination parameters in random graphs2009-02-26Paper
A Dynamic Model for On-Line Social Networks2009-02-10Paper
Vertex Pursuit Games in Stochastic Network Models2008-04-15Paper
https://portal.mardi4nfdi.de/entity/Q54576392008-04-14Paper
A Spatial Web Graph Model with Local Influence Regions2008-04-11Paper
A note on uniquely H-colorable graphs2008-02-22Paper
Graphs with the \(n\)-e.c. adjacency property constructed from affine planes2008-02-14Paper
https://portal.mardi4nfdi.de/entity/Q34239932007-02-15Paper
Mutually embeddable graphs and the tree alternative conjecture2007-01-16Paper
On an adjacency property of almost all tournaments2006-10-30Paper
Spanning subgraphs of graphs partitioned into two isomorphic pieces2006-03-24Paper
https://portal.mardi4nfdi.de/entity/Q54615122005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54608892005-07-20Paper
Infinite Limits of Copying Models of the Web Graph2005-04-11Paper
On a problem of Cameron's on inexhaustible graphs2004-10-19Paper
A note on orientations of the infinite random graph2004-10-13Paper
https://portal.mardi4nfdi.de/entity/Q44577402004-03-25Paper
Partitioning a graph into two isomorphic pieces2003-11-10Paper
Homomorphisms and amalgamation2003-09-04Paper
Large families of mutually embeddable vertex-transitive graphs2003-06-25Paper
Generalized pigeonhole properties of graphs and oriented graphs2003-01-05Paper
On retracts of the random graph and their natural order2002-06-10Paper
Metrically Universal Generic Structures in Free Amalgamation Classes2002-06-03Paper
A family of universal pseudo-homogeneous \(G\)-colourable graphs2002-05-28Paper
On an adjacency property of almost all graphs2001-11-28Paper
https://portal.mardi4nfdi.de/entity/Q27471852001-11-18Paper
Tournaments and Orders with the Pigeonhole Property2001-10-16Paper
The monoid of the random graph2001-03-21Paper
Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property2001-01-09Paper
Continuum many universal Horn classes of graphs of bounded chromatic number2000-02-27Paper
A Pigeonhole Property for Relational Structures1999-09-22Paper
The model companion of width-two orders1999-03-02Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Anthony Bonato