Matching Theory: Applying to Graphs Beyond Bipartite?

Context:
Thread starter student3
Start date Sep 7, 2016
Tags

Graphs Theory

Join the discussion

Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.

Real named experts · corrections over time · the nuance an AI answer skips

1 reply · 2K views

student3

Thread starter
Sep 7, 2016

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?

Physics news on Phys.org

Quantum entanglement without transport: Leaky qubits offer route around noisy channels
How quantum circuits based on neutral atoms could find and fix errors
AI unlocks QLED recipe that doubles efficiency and boosts lifetime 40-fold

alyafey22

Gold Member

MHB

Sep 7, 2016

A matching can be defined on any graph. It is a general concept.

Matching Theory: Applying to Graphs Beyond Bipartite?

Is A.I. more than the sum of its parts?

AI vs. Humans as Processors in an Environment

Sweetspot of data compression

Other than just FizzBuzz to test programmer candidates

How to show RS(U+TRS)* is equivalent to (R+SUT)SU?

Insights Revisiting the Velocity-Time Function

Insights Remote Operated Gate Control System

Insights AI Enriched Problem Solving

Insights Thinking Outside The Box Versus Knowing What’s In The Box

Insights Why Entangled Photon-Polarization Qubits Violate Bell’s Inequality

Insights Quantum Entanglement is a Kinematic Fact, not a Dynamical Effect

Matching Theory: Applying to Graphs Beyond Bipartite?

Similar threads