13 problems
- 0 votes0 replies0 views
Strong conjecture on F-irregular graphs
Strong conjecture on -irregular graphs. For each connected graph of order , there exist infinitely many -irregular graphs.
- 0 votes0 replies0 views
Chartrand–Holbert–Oellermann–Swart conjecture on F-irregular graphs
Chartrand–Holbert–Oellermann–Swart conjecture. For every connected graph of order at least , there exists a nontrivial -irregular graph.
- 0 votes0 replies0 views
The spectral extremal conjecture for bowties with q added edges
Spectral bowtie conjecture. For , if is a graph of sufficiently large order satisfying
- 0 votes0 replies0 views
The recursive upper-bound conjecture for tournament counting
For each positive integer , let denote the exponent for counting copies of an arbitrary -vertex tournament. Recursive counting conjecture. For all it holds t…
- 0 votes0 replies0 views
Eventual equality of tournament counting exponents
For a positive integer , let be the exponent for counting copies of an arbitrary -vertex tournament, and let be the exponent for counting copies of the transi…
- 0 votes0 replies0 views
The counting-versus-detection conjecture for tournaments
For a positive integer , let be the exponent for counting copies of an arbitrary -vertex tournament, and let be the exponent for counting copies of the transi…
- 0 votes0 replies0 views
The polynomial homomorphism-growth conjecture for graphs on the sphere
Polynomial homomorphism-growth conjecture. For some integer ,
- 0 votes0 replies0 views
Asymptotic quasi-complete bipartite extremal conjecture
Asymptotic quasi-complete bipartite extremal conjecture. For any integers with and any bipartite graph , we have
- 0 votes0 replies0 views
The uniformly monotone decision dichotomy conjecture
Let be a uniformly monotone property, and let denote its class of minimal graphs. Assume that there is no constant such that every graph in has…
- 0 votes0 replies0 views
Flum–Grohe's unbounded-treewidth subgraph decision conjecture
Let be a class of graphs with unbounded treewidth, and let denote the parameterised subgraph decision problem for the…
- 0 votes0 replies0 views
The uniformly monotone exact counting dichotomy conjecture
Let be a uniformly monotone property, and let denote its class of minimal graphs. Vertex-cover number measures the minimum size of a vertex set meeting every ed…
- 0 votes0 replies0 views
Uniqueness of difficult subgraph-counting identities
Uniqueness conjecture. For every , there is only one subgraph-counting identity modulo the easily described families and the difficult identities for lower .
- 0 votes0 replies0 views
Existence of difficult subgraph-counting identities
Existence conjecture. For every , there is such an identity that holds for every graph with vertices, has one graph or with vertices, and…