Results 271 to 280 of about 34,683 (312)
, 1980 Some of the next articles are maybe not open access.
Related searches:
Related searches:
2005
In this chapter we study how global parameters of a graph, such as its edge density or chromatic number, can influence its local substructures. How many edges, for instance, do we have to give a graph on n vertices to be sure that, no matter how these edges are arranged, the graph will contain a K r subgraph for some given r?
openaire +1 more source
In this chapter we study how global parameters of a graph, such as its edge density or chromatic number, can influence its local substructures. How many edges, for instance, do we have to give a graph on n vertices to be sure that, no matter how these edges are arranged, the graph will contain a K r subgraph for some given r?
openaire +1 more source
Finite Geometry and Extremal Graph Theory
2022The present paper reviews some results about the Turan number of bipartite graphs and about clique-free pseudorandom graphs. The geometric aspect of known construction is highlighted, sometimes providing a different proof of known results and giving a new prospective on how to tackles such problems. Some new results are also presented.
openaire +3 more sources
Extremal problems in graph theory
Journal of Graph Theory, 1977AbstractThe aim of this note is to give an account of some recent results and state a number of conjectures concerning extremal properties of graphs.
openaire +2 more sources
An extremal problem in graph theory
Israel Journal of Mathematics, 1968It is proved that the maximum number of cut-vertices in a connected graph withn vertices andm edges is $$max\left\{ {q:m \leqq (_2^{n - q} ) + q} \right\}$$ All the extremal graphs are determined and the corresponding problem for cut-edges is also solved.
openaire +2 more sources
On some extremal problems in graph theory
Israel Journal of Mathematics, 1965Der Verf. beweist, daß für eine genügend große Konstante \(c\) jeder Graph \(G\) mit \(n\) Punkten und \(cn^{3/2}\) Kanten ein Sechseck \(x_1,x_2,x_3,x_4,x_5,x_6\) enthält und dazu noch einen siebenten Punkt \(y\), der mit \(x_1,x_3\) und \(x_5\) verbunden ist.
openaire +2 more sources