A PROBLEM ON INDEPENDENT r-TUPLES

@inproceedings{Erds1965APO,
  title={A PROBLEM ON INDEPENDENT r-TUPLES},
  author={Paul Erdős},
  year={1965}
}
then G(n ; l) contains k independent edges . It is easy to see that the above result is best possible since the complete graph of 2k-1 vertices and the graph of vertices x1, . . ., xk-1 ; Yl, • • •, Yn-k+l and edges (x1 , xj), 1I ; (x1 , y), 1 i :!-< k 1, 1-yj :!5 n k + 1 clearly does not contain k independent edges . By an r-graph o(r) we shall mean a graph whose basic elements are its vertices and r-tuples ; for r = 2 we obtain the ordinary graphs . G (r) (n ; m) will denote an r-graph of n… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 49 CITATIONS, ESTIMATED 45% COVERAGE

110 Citations

01020'76'86'97'08'19
Citations per Year
Semantic Scholar estimates that this publication has 110 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

RADO, Intersection theorems for systems of finite sets, Quarterly

  • P. ERDős, R. CHAO Ko
  • o f Math .,
  • 1961

Similar Papers

Loading similar papers…