Forbidden subgraphs in the norm graph
We show that the norm graph with n vertices about View the MathML source edges, which contains no copy of the complete bipartite graph Kt,(t-1)!+1, does not contain a copy of Kt+1,(t-1)!-1.
| Authors: | , |
|---|---|
| Format: | article |
| Publication Date: | 2016 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/115152 |
| Online Access: | https://hdl.handle.net/2117/115152 https://dx.doi.org/10.1016/j.disc.2015.11.010 |
| Access Level: | Open access |
| Keyword: | Graph theory Forbidden subgraph Norm graph Grafs, Teoria de Àrees temàtiques de la UPC::Matemàtiques i estadística |
| Summary: | We show that the norm graph with n vertices about View the MathML source edges, which contains no copy of the complete bipartite graph Kt,(t-1)!+1, does not contain a copy of Kt+1,(t-1)!-1. |
|---|