AbstractLet v, e and t denote the number of vertices, edges and triangles, respectively, of a K4-free graph. Fisher (1988) proved that t ⩽ (e/3)3/2, independently of v. His bound is attained when e = 3k2 for some integer k, but not in general. We find here, for any given value of e, the maximum possible value of t. Again, the maximum does not depend on v. We also show that certain ‘gaps’ occur in the set of triples (v, e, t) realizable by K4-free graphs
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independe...
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independe...
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independe...
AbstractWe show that a K4-free graph with e edges has at most (e⧸3)32 triangles. This supercedes a b...
AbstractWe show that a K4-free graph with e edges has at most (e⧸3)32 triangles. This supercedes a b...
Let F (n, r, k) denote the maximum number of edge r-colorings without a monochromatic copy of Kk tha...
AbstractIt is shown that if G is a graph such that the maximum size of a set of pairwise edge-disjoi...
Let F(n, r, k) denote the maximum number of edge r-colorings without a monochromatic copy of Kk that...
AbstractWe prove that a K4-free graph G of order n, size m and maximum degree at most three has an i...
AbstractFor given n, let G be a triangle-free graph of order n with chromatic number at least 4. In ...
We show the quarter of a century old conjecture that every K4-free graph with n vertices and ⌊n2/4⌋+...
AbstractWe determine the maximum number of oriented 4-cycles possible in triangle-free oriented grap...
We construct, for all positive integers u, and v with u less than or equal to v, a decomposition of ...
AbstractThomassen recently proved, using the Tutte cycle technique, that if G is a 3-connected cubic...
We prove that the maximum number of triangles in a C5-free graph on n vertices is at most 1/2√2(1+o(...
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independe...
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independe...
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independe...
AbstractWe show that a K4-free graph with e edges has at most (e⧸3)32 triangles. This supercedes a b...
AbstractWe show that a K4-free graph with e edges has at most (e⧸3)32 triangles. This supercedes a b...
Let F (n, r, k) denote the maximum number of edge r-colorings without a monochromatic copy of Kk tha...
AbstractIt is shown that if G is a graph such that the maximum size of a set of pairwise edge-disjoi...
Let F(n, r, k) denote the maximum number of edge r-colorings without a monochromatic copy of Kk that...
AbstractWe prove that a K4-free graph G of order n, size m and maximum degree at most three has an i...
AbstractFor given n, let G be a triangle-free graph of order n with chromatic number at least 4. In ...
We show the quarter of a century old conjecture that every K4-free graph with n vertices and ⌊n2/4⌋+...
AbstractWe determine the maximum number of oriented 4-cycles possible in triangle-free oriented grap...
We construct, for all positive integers u, and v with u less than or equal to v, a decomposition of ...
AbstractThomassen recently proved, using the Tutte cycle technique, that if G is a 3-connected cubic...
We prove that the maximum number of triangles in a C5-free graph on n vertices is at most 1/2√2(1+o(...
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independe...
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independe...
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independe...
DOI
Add to ORKG