Forbidden subgraphs in the norm graph
classification
🧮 math.CO
keywords
copygraphnormbipartitecombinatoricaconstructedcontaincontains
read the original abstract
We show that the norm graph constructed in [J. Koll\'{a}r, L. R\'{o}nyai and T. Szab\'o, Norm-graphs and bipartite Tur\'{a}n numbers, Combinatorica, 16 (1996) 399--406] with $n$ vertices about $\frac{1}{2}n^{2-1/t}$ edges, which contains no copy of $K_{t,(t-1)!+1}$, does not contain a copy of $K_{t+1,(t-1)!-1}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.