MATH
Login Or Sign up

List Question

15
473
Views

How many trees on $\{1,2,3,4,5,6,7\}$ have a vertex of degree 2?

Published on
#combinatorics #graph-theory #inclusion-exclusion
57
Views

Why is a Möbius loop not a surface?

Published on
#general-topology #graph-theory
70
Views

Trees on $\{1,2,3,4,5,6,7,8\}$ with conditions

Published on
#combinatorics #discrete-mathematics #graph-theory #inclusion-exclusion
339
Views

Bipartite graph Matching, M-augmenting path

Published on
#discrete-mathematics #graph-theory #bipartite-graphs
451
Views

Number of Regions formed in a circle- Planar graphs, Euler's formula

Published on
#discrete-mathematics #graph-theory #circles #planar-graphs
859
Views

Are "unlabeled" graphs isomorphism classes of labeled graphs? How can people say things like $K_n$ is "the" complete graph on $n$ vertices?

Published on
#graph-theory #notation
296
Views

Given two distinct colors, show that every adjacent region is different

Published on
#general-topology #geometry #graph-theory
57
Views

Mathematical methods for solving pair-wise cheapest path.

Published on
#graph-theory #reference-request #soft-question #nonlinear-optimization #numerical-optimization
103
Views

Graph theory and combinatorics problem

Published on
#graph-theory #proof-explanation
720
Views

What are the good reading books to learn cluster algebra?

Published on
#abstract-algebra #graph-theory #reference-request #noncommutative-algebra #cluster-algebra
169
Views

How to get subgraph S comprised of nodes with multiple edges of a multigraph M?

Published on
#graph-theory #algorithms
162
Views

Can anyone suggest me some books on Leavitt Path algebra?

Published on
#abstract-algebra #graph-theory #noncommutative-algebra
353
Views

Group theory optimization; abstract algebra relevant?

Published on
#group-theory #graph-theory #optimization #computer-science #discrete-optimization
791
Views

Show that a graph has no hamiltonian cycle

Published on
#graph-theory #hamiltonicity
27
Views

Given undirected graph G and a MST T of G. Is it possible to design an O(V+E) algorithm to decide if some edge e is contained in a MST of G or not.

Published on
#graph-theory

Trending Questions

Popular # Hahtags

second-order-logic numerical-methods puzzle logic probability number-theory winding-number real-analysis integration calculus complex-analysis sequences-and-series proof-writing set-theory functions homotopy-theory elementary-number-theory ordinary-differential-equations circles derivatives game-theory definite-integrals elementary-set-theory limits multivariable-calculus geometry algebraic-number-theory proof-verification partial-derivative algebra-precalculus

Popular Questions

Copyright © 2021 JogjaFile Inc.