Results 261 to 270 of about 5,888,750 (277)
Some of the next articles are maybe not open access.
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 +3 more sources
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
On an extremal inverse problem in graph theory
Journal of Applied and Industrial Mathematics, 2015Summary: We consider the problem of constructing a graph having some given number of independent sets. The bounds are obtained for the number of vertices in bipartite graphs with the prescribed number of independent sets and for the number of inclusion maximal independent sets.
Daĭnyak, A. B., Kurnosov, A. D.
openaire +2 more sources
AN EXTREMAL PROBLEM IN GRAPH THEORY
The Quarterly Journal of Mathematics, 1980Abbott, H. L., Hanson, D., Liu, A. C.
openaire +1 more source
On an extremal inverse problem in the graph theory
Diskretnyi analiz i issledovanie operatsii, 2015Dainiak, A. B., Kurnosov, A. D.
openaire +1 more source

