Highly Influenced

# An Extremal Graph Problem

@inproceedings{ErdgsAnEG, title={An Extremal Graph Problem}, author={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