default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Tait
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]John Byrne, Michael Tait
:
Improved upper bounds on even-cycle creating Hamilton paths. Discret. Math. 347(10): 114107 (2024)- [j36]Alex Iosevich, Thang Pham, Steven Senger, Michael Tait:
Improved incidence bounds over arbitrary finite fields via the VC-dimension theory. Eur. J. Comb. 118: 103928 (2024) - [i2]Kathryn Haymaker, Michael Tait, Craig Timmons:
Hypergraphs of girth 5 and 6 and coding theory. CoRR abs/2404.01839 (2024) - 2023
- [j35]Beka Ergemlidze, Abhishek Methuku, Michael Tait, Craig Timmons:
Minimizing the number of complete bipartite graphs in a Ks-saturated graph. Discuss. Math. Graph Theory 43(3): 793-807 (2023) - [j34]Mohamed Salama, Wael El-Dakhakhni, Michael Tait:
Systemic risk mitigation strategy for power grid cascade failures using constrained spectral clustering. Int. J. Crit. Infrastructure Prot. 42: 100622 (2023) - [j33]Sebastian M. Cioaba, Dheer Noal Desai, Michael Tait:
A Spectral Erdős-Sós Theorem. SIAM J. Discret. Math. 37(3): 2228-2239 (2023) - 2022
- [j32]Griffin Johnston, Michael Tait, Craig Timmons:
Upper and lower bounds on the size of $B_{k}[g]$ sets. Australas. J Comb. 83: 129-140 (2022) - [j31]Zachary DeStefano, Hannah Mahon, Frank Simutis, Michael Tait:
Multicolor Ramsey Numbers for Berge cycles. Electron. J. Comb. 29(4) (2022) - [j30]Ander Lamaison, Alp Müyesser, Michael Tait:
On a colored Turán problem of Diwan and Mubayi. Discret. Math. 345(10): 113003 (2022) - [j29]Sebastian M. Cioaba, Dheer Noal Desai, Michael Tait:
The spectral radius of graphs with no odd wheels. Eur. J. Comb. 99: 103420 (2022) - [j28]Alp Müyesser, Michael Tait:
Turán- and Ramsey-type results for unavoidable subgraphs. J. Graph Theory 101(4): 597-622 (2022) - 2021
- [j27]Michael Tait, Craig Timmons:
Regular Turán numbers of complete bipartite graphs. Discret. Math. 344(10): 112531 (2021) - [j26]Michael Tait, Robert J. Won:
Improved Bounds on Sizes of Generalized Caps in AG(n, q). SIAM J. Discret. Math. 35(1): 521-531 (2021) - 2020
- [j25]Sebastian M. Cioaba, Lihua Feng, Michael Tait, Xiao-Dong Zhang:
The Maximum Spectral Radius of Graphs Without Friendship Subgraphs. Electron. J. Comb. 27(4): 4 (2020) - [j24]Boris Bukh, Michael Tait:
Turán numbers of theta graphs. Comb. Probab. Comput. 29(4): 495-507 (2020) - [j23]Jürgen Kritschgau, Abhishek Methuku, Michael Tait, Craig Timmons:
Few H copies in F -saturated graphs. J. Graph Theory 94(3): 320-348 (2020)
2010 – 2019
- 2019
- [j22]Jessica De Silva, Xiang Si, Michael Tait, Yunus Tunçbilek, Ruifan Yang, Michael Young:
Anti-Ramsey multiplicities. Australas. J Comb. 73: 357-371 (2019) - [j21]Cory Palmer, Michael Tait, Craig Timmons, Zsolt Adam Wagner:
Turán numbers for Berge-hypergraphs and related extremal problems. Discret. Math. 342(6): 1553-1563 (2019) - [j20]Michael Tait:
On a problem of Neumann. Discret. Math. 342(10): 2843-2845 (2019) - [j19]Sean English, Dániel Gerbner, Abhishek Methuku, Michael Tait:
Linearity of saturation for Berge hypergraphs. Eur. J. Comb. 78: 205-213 (2019) - [j18]Michael Tait:
The Colin de Verdière parameter, excluded minors, and the spectral radius. J. Comb. Theory A 166: 42-58 (2019) - [j17]Zhiyang He, Michael Tait:
Hypergraphs with Few Berge Paths of Fixed Length between Vertices. SIAM J. Discret. Math. 33(3): 1472-1481 (2019) - 2018
- [j16]Sinan G. Aksoy, Fan Chung, Michael Tait, Josh Tobin:
The maximum relaxation time of a random walk. Adv. Appl. Math. 101: 1-14 (2018) - [j15]Manuel Fernández, Nicholas Sieger, Michael Tait:
Maximal Planar Subgraphs of Fixed Girth in Random Graphs. Electron. J. Comb. 25(2): 2 (2018) - [j14]Vladimir Nikiforov, Michael Tait, Craig Timmons:
Degenerate Turán Problems for Hereditary Properties. Electron. J. Comb. 25(4): 4 (2018) - [j13]Po-Shen Loh, Michael Tait, Craig Timmons, Rodrigo M. Zhou:
Induced Turán Numbers. Comb. Probab. Comput. 27(2): 274-288 (2018) - [j12]Michael Tait:
Degree Ramsey numbers for even cycles. Discret. Math. 341(1): 104-108 (2018) - 2017
- [j11]Michael Tait, Josh Tobin:
Three conjectures in extremal spectral graph theory. J. Comb. Theory B 126: 137-161 (2017) - [j10]Thang Pham, Michael Tait, Craig Timmons, Le Anh Vinh:
A Szemerédi-Trotter type theorem, sum-product estimates in finite quasifields, and related results. J. Comb. Theory A 147: 55-74 (2017) - 2016
- [j9]Jessica De Silva, Theodore Molla, Florian Pfender, Troy Retter, Michael Tait:
Increasing Paths in Edge-Ordered Graphs: The Hypercube and Random Graph. Electron. J. Comb. 23(2): 2 (2016) - [j8]Michael Tait, Jacques Verstraëte:
On sets of integers with restrictions on their products. Eur. J. Comb. 51: 268-274 (2016) - [j7]Michael Tait, Craig Timmons:
Orthogonal Polarity Graphs and Sidon Sets. J. Graph Theory 82(1): 103-116 (2016) - [j6]Michael Tait, Craig Timmons:
Independent Sets in Polarity Graphs. SIAM J. Discret. Math. 30(4): 2115-2129 (2016) - 2015
- [j5]Michael Tait, Craig Timmons:
Small dense subgraphs of polarity graphs and the extremal number for the 4-cycle. Australas. J Comb. 63: 107-114 (2015) - [j4]Xing Peng, Michael Tait, Craig Timmons:
On the Chromatic Number of the Erdős-Rényi Orthogonal Polarity Graph. Electron. J. Comb. 22(2): 2 (2015) - [j3]Bob Chen, Jeong Han Kim, Michael Tait, Jacques Verstraëte:
On coupon colorings of graphs. Discret. Appl. Math. 193: 94-101 (2015) - 2013
- [j2]Sebastian M. Cioaba, Michael Tait:
Variations on a theme of Graham and Pollak. Discret. Math. 313(5): 665-676 (2013) - [i1]Michael Tait, Alexander Vardy, Jacques Verstraëte:
Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Permutation Codes. CoRR abs/1311.4925 (2013) - 2011
- [j1]Sebastian M. Cioaba, Michael Tait:
More Counterexamples to the Alon-Saks-Seymour and Rank-Coloring Conjectures. Electron. J. Comb. 18(1) (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
