For given integers k, l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l-vertex graph. Here we prove this claim for k = l = 3 with a sharp bound. A similar phenomenon is established as wel
Consider a graph G on n vertices with αn 2 edges which does not contain an induced K2,t (t > 2). How...
The codegree threshold ex2 (n, F) of a 3-graph F is the minimum d = d(n) such that every 3-graph on ...
AbstractIn this paper it is proved that the lower bound for the number of 3-circuits in a uniquely 3...
A finite graph G is {\em k-common} if the minimum (over all k-colourings of the edges of Kn) of the ...
We investigate a covering problem in 3-uniform hypergraphs (3-graphs): Given a 3-graph F, what is c(...
Abstract. It is well known that any two longest paths in a connected graph share a vertex. It is als...
We define a new class of graphs called fair sharing graphs and prove that every three longest paths ...
The codegree threshold ex2(n, F) of a non-empty 3-graph F is the minimum d = d(n) such that every 3-...
We prove the asymptotically best possible result that, for every integer k ≥ 2, every 3-uniform grap...
A universal labeling of a graph G is a labeling of the edge set in G such that in every orientation ...
AbstractSzemerédi's regularity lemma proved to be a powerful tool in extremal graph theory. Many of ...
International audienceThe 1-2-3 Conjecture states that every connected graph different from K2 admit...
AbstractWe show the following. (1) For each integer n⩾12, there exists a uniquely 3-colorable graph ...
AbstractMcCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a con...
International audienceThe 1-2-3 Conjecture states that every connected graph different from K2 admit...
Consider a graph G on n vertices with αn 2 edges which does not contain an induced K2,t (t > 2). How...
The codegree threshold ex2 (n, F) of a 3-graph F is the minimum d = d(n) such that every 3-graph on ...
AbstractIn this paper it is proved that the lower bound for the number of 3-circuits in a uniquely 3...
A finite graph G is {\em k-common} if the minimum (over all k-colourings of the edges of Kn) of the ...
We investigate a covering problem in 3-uniform hypergraphs (3-graphs): Given a 3-graph F, what is c(...
Abstract. It is well known that any two longest paths in a connected graph share a vertex. It is als...
We define a new class of graphs called fair sharing graphs and prove that every three longest paths ...
The codegree threshold ex2(n, F) of a non-empty 3-graph F is the minimum d = d(n) such that every 3-...
We prove the asymptotically best possible result that, for every integer k ≥ 2, every 3-uniform grap...
A universal labeling of a graph G is a labeling of the edge set in G such that in every orientation ...
AbstractSzemerédi's regularity lemma proved to be a powerful tool in extremal graph theory. Many of ...
International audienceThe 1-2-3 Conjecture states that every connected graph different from K2 admit...
AbstractWe show the following. (1) For each integer n⩾12, there exists a uniquely 3-colorable graph ...
AbstractMcCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a con...
International audienceThe 1-2-3 Conjecture states that every connected graph different from K2 admit...
Consider a graph G on n vertices with αn 2 edges which does not contain an induced K2,t (t > 2). How...
The codegree threshold ex2 (n, F) of a 3-graph F is the minimum d = d(n) such that every 3-graph on ...
AbstractIn this paper it is proved that the lower bound for the number of 3-circuits in a uniquely 3...
DOI
Add to ORKG