24 problems
If is bipartite and is -degenerate, that is, every induced subgraph of has minimum degree , then
If is a finite set of finite graphs then is the maximum number of edges a graph on vertices can have without containing any subgraphs…
For all integers , let be the complete -partite -uniform hypergraph with vertices in each part. Is it true that, for every real , all su…
For integers , let be the family of all -uniform hypergraphs with vertices and edges. Determine the extremal number…
For integers and , let denote the maximum number of edges in a -free simple graph on vertices, and let be the least nu…
Let n be a positive integer and let G=(V,E) be a 3-uniform hypergraph, meaning that E is a set of 3-element subsets of V. Is it true that for every such G with |V|=3n and |E|≥n^3+1…
Let be the largest number of edges in an -vertex graph having no cycle with chords incident to a single vertex of the cycle. Is for all suff…
Let , where ranges over all graphs with vertices and edges. Give good estimates for in the range . For fixed…
Determine an asymptotic formula for , the largest number of edges in an -vertex graph containing no four-cycle.
Is it true that, for every bipartite graph , there exists some and such that Must be rational?
Determine, for any , the value of where is the largest number of -edges which can placed on …
For every real number , does there exist a constant and an integer such that, for every integer and every finite simple grap…
For a positive integer , let be the graph with vertex set , with two vertices adjacent if they differ in exactly one coordinate. Thus has vertices a…
Let be a finite family of finite graphs. For a positive integer , let be the maximum number of edges in an -vertex graph cont…
For a family of graphs , let be the maximum number of edges in a simple graph on vertices that contains no subgraph isomorphic to any me…
For a positive integer , let be the maximum number of edges in a simple graph on vertices containing neither a triangle nor a four-cycle…
For a positive integer , let be the maximum number of edges in a simple graph on vertices containing no subgraph isomorphic to the cycle of…
For a finite simple graph , let be the maximum number of edges in a simple graph on vertices that contains no subgraph isomorphic to ; the forbid…
For an integer , let a -uniform hypergraph on an -element vertex set have an edge set . A copy of is a four-element set…
Let be a fixed finite bipartite graph, and write for its minimum degree. For a positive integer , let be the maximum number of edges in…
For a finite graph , let be the maximum number of edges in an -vertex graph containing no subgraph isomorphic to . A graph is -degenerate if ev…
Let be a fixed graph containing a cycle, and let be the maximum number of edges in an -free graph on vertices. Is the number of labelled -fre…
A balanced double star is the graph obtained from an edge whose endpoints are joined respectively to and additional distinct vertices. For a planar graph family,…