Michael Tait

According to our database1, Michael Tait authored at least 36 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


A Spectral Erdős-Sós Theorem.
SIAM J. Discret. Math., September, 2023

Systemic risk mitigation strategy for power grid cascade failures using constrained spectral clustering.
Int. J. Crit. Infrastructure Prot., September, 2023

Minimizing the number of complete bipartite graphs in a K<sub>s</sub>-saturated graph.
Discuss. Math. Graph Theory, 2023

Turán- and Ramsey-type results for unavoidable subgraphs.
J. Graph Theory, 2022

The spectral radius of graphs with no odd wheels.
Eur. J. Comb., 2022

On a colored Turán problem of Diwan and Mubayi.
Discret. Math., 2022

Multicolor Ramsey Numbers for Berge cycles.
Electron. J. Comb., 2022

Upper and lower bounds on the size of $B_{k}[g]$ sets.
Australas. J Comb., 2022

Improved Bounds on Sizes of Generalized Caps in AG(n, q).
SIAM J. Discret. Math., 2021

Regular Turán numbers of complete bipartite graphs.
Discret. Math., 2021

Few H copies in F -saturated graphs.
J. Graph Theory, 2020

Turán numbers of theta graphs.
Comb. Probab. Comput., 2020

The Maximum Spectral Radius of Graphs Without Friendship Subgraphs.
Electron. J. Comb., 2020

Hypergraphs with Few Berge Paths of Fixed Length between Vertices.
SIAM J. Discret. Math., 2019

The Colin de Verdière parameter, excluded minors, and the spectral radius.
J. Comb. Theory, Ser. A, 2019

Linearity of saturation for Berge hypergraphs.
Eur. J. Comb., 2019

On a problem of Neumann.
Discret. Math., 2019

Turán numbers for Berge-hypergraphs and related extremal problems.
Discret. Math., 2019

Anti-Ramsey multiplicities.
Australas. J Comb., 2019

Degree Ramsey numbers for even cycles.
Discret. Math., 2018

Induced Turán Numbers.
Comb. Probab. Comput., 2018

Degenerate Turán Problems for Hereditary Properties.
Electron. J. Comb., 2018

Maximal Planar Subgraphs of Fixed Girth in Random Graphs.
Electron. J. Comb., 2018

The maximum relaxation time of a random walk.
Adv. Appl. Math., 2018

Three conjectures in extremal spectral graph theory.
J. Comb. Theory, Ser. B, 2017

A Szemerédi-Trotter type theorem, sum-product estimates in finite quasifields, and related results.
J. Comb. Theory, Ser. A, 2017

Independent Sets in Polarity Graphs.
SIAM J. Discret. Math., 2016

Orthogonal Polarity Graphs and Sidon Sets.
J. Graph Theory, 2016

On sets of integers with restrictions on their products.
Eur. J. Comb., 2016

Increasing Paths in Edge-Ordered Graphs: The Hypercube and Random Graph.
Electron. J. Comb., 2016

On coupon colorings of graphs.
Discret. Appl. Math., 2015

On the Chromatic Number of the Erdős-Rényi Orthogonal Polarity Graph.
Electron. J. Comb., 2015

Small dense subgraphs of polarity graphs and the extremal number for the 4-cycle.
Australas. J Comb., 2015

Variations on a theme of Graham and Pollak.
Discret. Math., 2013

Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Permutation Codes.
CoRR, 2013

More Counterexamples to the Alon-Saks-Seymour and Rank-Coloring Conjectures.
Electron. J. Comb., 2011