MHB Matching Theory: Applying to Graphs Beyond Bipartite?

  • Thread starter Thread starter student3
  • Start date Start date
  • Tags Tags
    Graphs Theory
Click For Summary
Matching theory is primarily known for its application in bipartite graphs, but it can also be applied to other types of graphs, including complete graphs. A matching is defined as a set of edges without common vertices, making it a general concept that extends beyond bipartite structures. The discussion highlights the versatility of matching theory in various graph types. Understanding its application in non-bipartite graphs can lead to broader insights in graph theory. Overall, matching theory's principles are applicable to a wide range of graph structures.
student3
I understand that matching theory (can) applies to bipartite graph.
My questions is can matching theory be also apply any other graphs, such as complete graph?
 
Technology news on Phys.org
A matching can be defined on any graph. It is a general concept.
 

Thread 'For those who ask: "What programming language should I learn?"'

Learn If you want to write code for Python Machine learning, AI Statistics/data analysis Scientific research Web application servers Some microcontrollers JavaScript/Node JS/TypeScript Web sites Web application servers C# Games (Unity) Consumer applications (Windows) Business applications C++ Games (Unreal Engine) Operating systems, device drivers Microcontrollers/embedded systems Consumer applications (Linux) Some more tips: Do not learn C++ (or any other dialect of C) as a...
View full post »

Similar threads

Python Help solving a geometrical matching issue with Graph Neural Networks
  • · Replies 1 ·
Replies
1
Views
2K
Sudoku solver by graph coloring theory
  • · Replies 8 ·
Replies
8
Views
2K
MHB Bipartite Graphs: Does $\alpha(G) =|U|$?
  • · Replies 1 ·
Replies
1
Views
2K
Python Understanding Graph Neural Networks (GNNs) Tutorials & Examples
  • · Replies 2 ·
Replies
2
Views
3K
Python Confused about recursion in python-depth first search-:
  • · Replies 3 ·
Replies
3
Views
1K
MHB Understanding Two Graph Theory Problems
  • · Replies 2 ·
Replies
2
Views
2K
MHB How many new branches will the complement graph of a deleted edge have?
  • · Replies 11 ·
Replies
11
Views
2K
I I would simply like to know how to get 2^k.
  • · Replies 4 ·
Replies
4
Views
3K
Comp Sci Shortest path problem in bipartite graph
  • · Replies 1 ·
Replies
1
Views
2K
Counting edge numbers in bipartite graphs
  • · Replies 1 ·
Replies
1
Views
1K