Skip to main content
D. Ror.'s user avatar
D. Ror.'s user avatar
D. Ror.'s user avatar
D. Ror.
  • Member for 8 years, 2 months
  • Last seen more than a month ago
awarded
awarded
awarded
comment
Components of bipartite graphs that are trees
@hungrygrad If you are satisfied with the answers given, please accept the community wiki answer below so your question can be marked as answered.
revised
"Edge Density" of Infinite Planar Graphs
Added problem number for reference.
Loading…
answered
Loading…
comment
Name and information about this graph
Off-the-cuff naming idea: (generally) multi-bound n-page clique-book; (specific to your case) 2-bound n-page K_4-book.
comment
Name and information about this graph
Because the number of possible variations explodes when multiple edges are allowed, you're unlikely to find much (if any) previous research on such a specific class as you've defined.
comment
Name and information about this graph
graphclasses.org has a rather extensive list of named graph classes; it is more browsable and less searchable than HoG and it also lacks multigraphs.
comment
Name and information about this graph
House of Graphs (hog.grinvin.org) can occasionally help you with this sort of question, but it is not nearly as large or well-established as the OEIS and it does not deal with multigraphs.
awarded
awarded
comment
Divisibility of a binomial sequence
@darijgrinberg ...and divisible by $(n+1)$ but not $(n+1)^2$ for odd exponents greater than $1$.
comment
Divisibility of a binomial sequence
Empirically, $\sum_{k=0}^n \sum_{j=0}^k {k\ \choose j}^2 {2j \choose j} (2j+1) = (n+1)^2 \sum_{i = 0}^n {n \choose i}^2 C_i$, where $C_i$ is the $i$-th Catalan number.
revised
Loading…
comment
Pell-type equations with no integer solutions
You can check the equation modulo $n$ for various $n$. For example, there are no integer solutions when $a \equiv 0 \!\!\!\mod \!3$ and $b \equiv 2 \!\!\!\mod \!3$.
awarded
answered
Loading…
awarded
1
2 3 4 5