The following pages link to Michael Tait (Q254891):
Displayed 50 items.
- On the distance spectra of graphs (Q254892) (← links)
- Increasing paths in edge-ordered graphs: the hypercube and random graph (Q281608) (← links)
- Sidon sets and graphs without 4-cycles (Q477968) (← links)
- On sets of integers with restrictions on their products (Q499476) (← links)
- Spectral bounds for the \(k\)-independence number of a graph (Q501229) (← links)
- A Szemerédi-Trotter type theorem, sum-product estimates in finite quasifields, and related results (Q501687) (← links)
- More counterexamples to the Alon-Saks-Seymour and rank-coloring conjectures (Q625392) (← links)
- A structure theorem for product sets in extra special groups (Q1679633) (← links)
- The maximum relaxation time of a random walk (Q1795486) (← links)
- Variations on a theme of Graham and Pollak (Q1939586) (← links)
- Turán numbers for Berge-hypergraphs and related extremal problems (Q1999723) (← links)
- The Colin de Verdière parameter, excluded minors, and the spectral radius (Q2000642) (← links)
- Regular Turán numbers of complete bipartite graphs (Q2043399) (← links)
- Multicolor Ramsey numbers for Berge cycles (Q2112557) (← links)
- On the spread of outerplanar graphs (Q2125585) (← links)
- Spectral extremal graphs for intersecting cliques (Q2125679) (← links)
- On a colored Turán problem of Diwan and Mubayi (Q2144601) (← links)
- The maximum spectral radius of graphs without friendship subgraphs (Q2209893) (← links)
- The spectral radius of graphs with no odd wheels (Q2237854) (← links)
- On a problem of Neumann (Q2317655) (← links)
- Improved lower bound for difference bases (Q2322896) (← links)
- Sidon sets and 2-caps in \(\mathbb{F}_3^n\) (Q2326853) (← links)
- On the chromatic number of the Erdős-Rényi orthogonal polarity graph (Q2344823) (← links)
- On coupon colorings of graphs (Q2354722) (← links)
- Three conjectures in extremal spectral graph theory (Q2399353) (← links)
- Degree Ramsey numbers for even cycles (Q2411600) (← links)
- Linearity of saturation for Berge hypergraphs (Q2422222) (← links)
- Orthogonal Polarity Graphs and Sidon Sets (Q2811198) (← links)
- Independent Sets in Polarity Graphs (Q2832577) (← links)
- Small dense subgraphs of polarity graphs and the extremal number for the 4-cycle (Q3451443) (← links)
- Characterizing graphs of maximum principal ratio (Q4568074) (← links)
- Induced Turán Numbers (Q4643317) (← links)
- Proof of a conjecture of Graham and Lov\'asz concerning unimodality of coefficients of the distance characteristic polynomial of a tree (Q4685888) (← links)
- Turán numbers of theta graphs (Q4993102) (← links)
- Few <i>H</i> copies in <i>F</i>‐saturated graphs (Q5066892) (← links)
- The Zarankiewicz problem in 3‐partite graphs (Q5226158) (← links)
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices (Q5232163) (← links)
- Improved Bounds on Sizes of Generalized Caps in $AG(n,q)$ (Q5857007) (← links)
- Upper and lower bounds on the size of $B_k[g]$ sets (Q5863480) (← links)
- Turán‐ and Ramsey‐type results for unavoidable subgraphs (Q6046642) (← links)
- Maximum spread of graphs and bipartite graphs (Q6052388) (← links)
- A Spectral Erdős-Sós Theorem (Q6072289) (← links)
- Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs (Q6084878) (← links)
- Regular graphs of degree at most four that allow two distinct eigenvalues (Q6084879) (← links)
- Sparsity of graphs that allow two distinct eigenvalues (Q6173926) (← links)
- Large monochromatic components in 3‐edge‐colored Steiner triple systems (Q6187431) (← links)
- Improved incidence bounds over arbitrary finite fields via the VC-dimension theory (Q6201908) (← links)
- Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Permutation Codes (Q6246609) (← links)
- The spectral radius of graphs with no intersecting triangles (Q6330096) (← links)
- Minimizing the number of complete bipartite graphs in a $K_s$-saturated graph (Q6357442) (← links)