Name
Abstract | ||
|---|---|---|
Let N ( n , k ) be the minimum number of pairwise edge disjoint monochromatic complete graphs K k in any 2-coloring of the edges of a K n . Upper and lower bounds on N ( n , k ) will be given for k ⩾3. For k =3, exact values will be given for n ⩽11, and these will be used to give a lower bound for N ( n ,3). |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0012-365X(00)00312-5 | Discrete Mathematics |
Keywords | Field | DocType |
2-colored graph,edge disjoint monochromatic triangle,complete graph,lower bound,upper and lower bounds | Discrete mathematics,Graph,Colored,Monochromatic color,Combinatorics,Disjoint sets,Upper and lower bounds,Mathematics | Journal |
Volume | Issue | ISSN |
231 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
8 | 0.93 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. Erdős | 1 | 37 | 6.93 |
| R. J. Faudree | 2 | 174 | 38.15 |
| R. J. Gould | 3 | 8 | 0.93 |
| M. S. Jacobson | 4 | 198 | 40.79 |
| J. Lehel | 5 | 391 | 75.03 |