Skip to main content
MathOverflow

Return to Question

Post Closed as "Not suitable for this site" by user44191, Max Horn, Carl-Fredrik Nyberg Brodda, Mikhail Katz, Bugs Bunny
Mat Jaxed
Source Link
Daniele Tampieri
Daniele Tampieri
  • 6.4k
  • 7
  • 30
  • 45

I am trying to figure out the least number of directed edges that would be bi-directional after constructing a graph with 2k-1$2k-1$ nodes that are each k$k$ in-degree. For example, 2(2)-1=3$2(2)-1=3$ nodes that are 2$2$ in-degrees would force the graph to have 3$3$ symmetric edges.

Thank you in advance!

I am trying to figure out the least number of directed edges that would be bi-directional after constructing a graph with 2k-1 nodes that are each k in-degree. For example, 2(2)-1=3 nodes that are 2 in-degrees would force the graph to have 3 symmetric edges.

Thank you in advance!

I am trying to figure out the least number of directed edges that would be bi-directional after constructing a graph with $2k-1$ nodes that are each $k$ in-degree. For example, $2(2)-1=3$ nodes that are $2$ in-degrees would force the graph to have $3$ symmetric edges.

Thank you in advance!

Source Link
James
James
  • 1

Number of bi-directional (or symmetric edges)

I am trying to figure out the least number of directed edges that would be bi-directional after constructing a graph with 2k-1 nodes that are each k in-degree. For example, 2(2)-1=3 nodes that are 2 in-degrees would force the graph to have 3 symmetric edges.

Thank you in advance!