Letf(n, H, 5) be the maximal number of edges in a graph with n vertices not containing a subgraph H compatible with a transition system X in the family of transition systems !T. Here we will use a family of transition systems X,, defined through local edge colourings. At each vertex the edge set is
Graphs without quadrilaterals
✍ Scribed by Z Füredi
- Book ID
- 103506063
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 185 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Current graphs and a theorem of White are used to show the existence of almost complete regular bipartite graphs with quadrilateral embeddings conjectured by Pisanski. Decompositions of __K~n~__ and __K~n, n~__ into graphs with quadrilateral embeddings are discussed, and some thickness
The study of hypersurface quadrilateral singularities can be reduced to the study of elliptic K3 surfaces with a singular fiber of type I * 0 (superscript *, subscript 0), and therefore these notes consider, besides the topics of the title, such K3 surfaces too. The combinations of