911 problems
Let be a -regular edge-rooted pattern of depth and girth . For each edge-rooted pattern, let denote its constraint vector, and let…
Triangle-free extremal conjecture. Among connected triangle-free graphs on vertices, the extremal complete bipartite graphs have the maximum -irregularity.
For a finite tree with vertex degrees , define its Euler Sombor index by . For trees with a prescribed diameter …
Let be a graph, let , and let be an edge-weighted graph, possibly with loops. Define the weighted homomorphism count by … where is the edge…
There exists an absolute constant such that every bridgeless graph with vertices and minimum degree has a strong orientation satisfying…
For each fixed integer , determine, for all sufficiently large integers , the maximum signless-Laplacian spectral radius among all -v…
There is an absolute constant such that, for every graph with vertices and edges, , where is the least integ…
Let be the net graph, consisting of a triangle together with one distinct degree-one vertex adjacent to each vertex of the triangle. A graph is -saturated if contain…
For the book graph consisting of triangles sharing a common edge, determine the asymptotic behavior of for each fixed . T…
For integers and , determine the maximum number of edges in an -vertex graph containing no subgraph isomorphic to , namely de…
Let denote the number of induced paths on four vertices (induced -paths) in a simple graph . For integers and , call a -regular graph on vert…
For every integer , the book Ramsey number satisfies , where is the graph consisting of triangles sharing a common edge…
For every integer , there exists a constant such that, for every sufficiently large integer , every graph on vertices satisfying…
Does there exist a sequence of triangle-free graphs with such that, for a coefficient field ,…
For every fixed integer , let be the path on vertices and let be its suspension, obtained by adding one new vertex adjacent to every vertex of…
For every integer and every graph family such that for every , define to be the maximum n…
For every integer and every finite nonempty -free graph , the binding number satisfies , where…
For every integer , every edge-coloring contains a set with and a color such that…
For each fixed integer , determine the smallest function such that every -vertex graph with at least edges contains pairwise edge-disjoint cycles…
Let be a fixed graph with , and let be a fixed nonempty family of graphs. If no graph is a subgraph of any blow-up of , then for ever…
For every finite simple graph with vertices, adjacency eigenvalues , clique number , and , prov…
For every , there exist constants and such that, for every and every -vertex graph that is…
For every prime power and every , there exists a circular permutation of such that, with , each el…
For every edge-color-critical graph with , and every positive integer , let be the family of all -vertex, -free graphs that are not…
For every , there exists a constant such that, for every sufficiently large , every integer , and every -regular…