𝔖 Bobbio Scriptorium
✦   LIBER   ✦

About triangles in a graph and its complement

✍ Scribed by B. Radhakrishnan Nair; A. Vijayakumar

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
338 KB
Volume
131
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Packing triangles in a graph and its com
Packing triangles in a graph and its complement
✍ Peter Keevash; Benny Sudakov πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 1 views

## Abstract How few edge‐disjoint triangles can there be in a graph __G__ on __n__ vertices and in its complement $\overline {G}$? This question was posed by P. ErdΕ‘s, who noticed that if __G__ is a disjoint union of two complete graphs of order __n__/2 then this number is __n__^2^/12 + __o__(__n__

Some parameters of graph and its complem
Some parameters of graph and its complement
✍ Shao-ji Xu πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 627 KB

In this paper, we have discussed the Nordhaus-Gaddum problems for diameter d, girth g, circumference c and edge covering number ill-We have both got the following results. If both G and G are connected, then 4<~d+a~~ 6, then p+2<.c+~<.2p, 3(p-1)<~c.~<.p 2. If both G and G have no isolated vertex, th

The minimum number of subgraphs in a gra
The minimum number of subgraphs in a graph and its complement
✍ Lane Clark πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 265 KB πŸ‘ 2 views

## Abstract For a graphb __F__ without isolated vertices, let __M__(__F__; __n__) denote the minimum number of monochromatic copies of __F__ in any 2‐coloring of the edges of __K__~__n__~. Burr and Rosta conjectured that when __F__ has order __t__, size __u__, and __a__ automorphisms. Independent

Every (p, p-2) graph is contained in its
Every (p, p-2) graph is contained in its complement
✍ David Burns; Seymour Schuster πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 120 KB πŸ‘ 1 views

## Abstract The following is proved: If __G__ is graph of order __p__ (β‰₯2) and size __p__‐2, then there exists an isomorphic embedding of __G__ into its complement.

Triangles in a complete chromatic graph
Triangles in a complete chromatic graph with three colors
✍ A.W Goodman πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 556 KB

Let Kr~ be the complete graph on N vertices, and assume that each edge is assigned precisly one of three possible colors. An old and difficult problem is to find the minimum number of monochromatic triangles as a function of N. We are not able to solve this problem, but we can give sharp bounds for