An Extremal Graph Problem

@inproceedings{ErdgsAnEG,
  title={An Extremal Graph Problem},
  author={P Erdgs}
}
  • P Erdgs
Throughout this paper graphs are supposed not to contain loops and multiple edges. G " denotes a graph of n vertices but only if n is an upper index. e(G) denotes the number of edges, U(G) denotes the number of vertices, x(G) denotes the chromatic denotes the complete d-chromatic graph with ri vertices of the ith colour, i.e. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

A method for solving extremal problems in graph theory, stability problems Theory ofgraphs

  • M Simonovits
  • Proc. COB. held at Tihany
  • 1966

New inequalities concerning extremal properties of graphs, Theory ofgraphs

  • P Erd~s
  • Proc. Colloquium held at Tihany
  • 1966

On graphs that do not contain a Thomsen graph, C~r?ad

  • G Brown
  • Math. Bull
  • 1966

On a problem of Zarankiewicz

  • I Kbvla~~~~l&sos, P Turin
  • Coil. Math
  • 1954
1 Excerpt

13) and (9) proves that (14) 4K " ) = E+f(nI, K(3, rd) tjif(ni.Ki(Lr2))

  • 13) and (9) proves that (14) 4K " ) = E+f(nI, K(3…

C, do not contain K2 (1, rJ and con- sequently

  • Rj
  • Thus Ci does not contain K213) 4K " ) 5 E+f(n1…

This proves that K " has no exceptional vertices: C; =Ci

  • But

Similar Papers

Loading similar papers…