13 problems
- 0 votes0 replies0 views
Order bounds for 2K2-split minimal (∞, k)-polar obstructions
Order-bound conjecture. Then
- 0 votes0 replies0 views
Generalized spectral closedness conjecture for split graphs
Generalized spectral closedness conjecture for split graphs. The class is generalized spectrally closed, but it admits no walk-realizable…
- 0 votes0 replies1 view
Linear-time certifying algorithm conjecture for star coloring of split graphs
Linear-time certifying algorithm conjecture. For every fixed positive integer , there is a certifying algorithm that runs in time
- 0 votes0 replies0 views
The two-prime -primitive number conjecture
Let and be distinct primes, and let . Consider natural numbers of the form … A natural number is -primitive if it has the property and is…
- 0 votes0 replies0 views
Infinitude of -primitive squares
A natural number is called -primitive when it has the property but is not a nontrivial square multiple of another number with the property. Infinitude con…
- 0 votes0 replies0 views
Uniqueness of the -primitive decomposition for fixed square-free part
Let be square-free, and let be the set of -primitives with square-free part . A natural number has a -primitive decomposition if it c…
- 0 votes0 replies0 views
Dai–Zhang–Broerama–Zhang conjecture on Hamiltonicity of connected K_{1,r}-free split graphs
Dai–Zhang–Broerama–Zhang conjecture. Every -connected -free split graph is Hamiltonian.
- 0 votes0 replies1 view
Lyu–Hicks conjecture on biclique partitions of co-chordal graphs
Let be a co-chordal graph. The Lyu–Hicks conjecture. The biclique partition number satisfies … where denotes the number of maximal cliques in the compl…
- 0 votes0 replies0 views
Generalized Hamilton-connectedness conjecture for forbidden-star split graphs
Generalized Hamilton-connectedness conjecture. Every -connected -free split graph of order at least is Hamilton-connected.
- 0 votes0 replies0 views
Hilton's conjecture on subgraph-overfull graphs
Hilton's conjecture. If , then is Class 1 if and only if it is not subgraph-overfull. The supplied paper states that this conjecture holds for the clas…
- 0 votes0 replies0 views
Conjectured formula for defective Ramsey numbers in split graphs
Let denote the -defective Ramsey number for split graphs. Split-graph defective Ramsey conjecture. For all , … The formula is proposed to…
- 0 votes0 replies0 views
Conjecture that balanced split graphs asymptotically account for rapid growth
Let be the number of unbalanced split graphs on vertices, and let be the number of split graphs on vertices. The ratio of balanced split graphs to split graphs…
- 0 votes0 replies0 views
The relaxed locally identifying coloring conjecture for free-twin split graphs
Let be a free-twin split graph, meaning that is a split graph with no pair of free twins. Write for its relaxed locally identifying chromatic number and…