Forbidden subgraphs in the norm graph
From MaRDI portal
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 vertices about edges, which contains no copy of , does not contain a copy of .
Recommendations
Cites work
- Asymptotic improvements to the lower bound of certain bipartite Turán numbers
- Families of twisted tensor product codes
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- scientific article; zbMATH DE number 53569 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- New asymptotics for bipartite Turán numbers
- Newton polytopes of the classical resultant and discriminant
- Norm-graphs and bipartite Turán numbers
- Norm-graphs: Variations and applications
- On a problem of K. Zarankiewicz
- On the algebraic variety \(\mathcal V_{r,t}\)
- On the structure of linear graphs
- Singularities of hyperdeterminants
Cited in
(6)
This page was built for publication: Forbidden subgraphs in the norm graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906463)