## Abstract Let __K(p, q), p ≤ q__, denote the complete bipartite graph in which the two partite sets consist of __p__ and __q__ vertices, respectively. In this paper, we prove that (1) the graph __K(p, q)__ is chromatically unique if __p__ ≥ 2; and (2) the graph __K(p, q)__ ‐ __e__ obtained by del
On minors of graphs with at least 3n −4 edges
✍ Scribed by M. Khalifat; Themistocles Politof; A. Satyanarayana
- Publisher
- John Wiley and Sons
- Year
- 1993
- Tongue
- English
- Weight
- 390 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A point disconnecting set S of a graph G is a nontrivial m‐separator, where m = |S|, if the connected components of G ‐ S can be partitioned into two subgraphs, each of which has at least two points. A 3‐connected graph is quasi 4‐connected if it has no nontrivial 3‐separators. Suppose G is a graph having n ≥ 6 points. We prove three results: (1) If G is quasi 4‐connected with at least 3__n__ ‐ 4 edges, then the graph K^−^~1~, obtained from K~6~ by deleting an edge, is a minor of G. (2) If G has at least 3__n__ ‐ 4 edges then either K^−^~6~ or the graph obtained by pasting two disjoint copies of K~5~ together along a triangle is a minor of G. (3) If the minimum degree of G is at least 6, then K^−^~6~ is a minor of G. © 1993 John Wiley & Sons, Inc.
📜 SIMILAR VOLUMES
## Abstract Let __ex__~2~(__n, K__) be the maximum number of edges in a 2‐colorable __K__‐free 3‐graph (where __K__={123, 124, 134} ). The 2‐chromatic Turán density of __K__ is \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$\pi\_{2}({K}\_{4}^-) =lim\_{{n}\to \infty} {ex}\_{2}
## Abstract Cytogenetically visible imbalances without phenotypic effect are still rare despite the extent of large‐scale copy number variation in the normal population revealed by array CGH. Here we report on a phenotypically normal 30‐year‐old female with a de novo, cytogenetically visible, inter