Some open problems in matchings in graphs

On the Matching Problem for Special Graph Classes - IEEE Xplore

In the present paper we prove some new complexity bounds for various versions of problems related to perfect matchings in graphs with a polynomially bounded ...

Open Problems for the Barbados Graph Theory Workshop 2017

Let ν(H) be the maximal size of a matching in H and τ(H) the minimal size of a cover. An old conjecture of Tuza [8] is that given any graph G the minimal number ...

RESULTS AND OPEN PROBLEMS IN MATCHINGS IN REGULAR ...

Abstract. This survey paper deals with upper and lower bounds on the number of k-matchings in regular graphs on N vertices. For the upper bounds we recall ...

Matching (graph theory) - Wikipedia

Matching in bipartite graphs · Graduation problem is about choosing minimum set of classes from given requirements for graduation. · Hitchcock transport problem ...

Matching (Graph Theory) | Engineering Mathematics - GeeksforGeeks

Problem 9: Determine the maximum cardinality matching in a bipartite graph. Problem 10: Find the minimum edge cover in a bipartite graph.

Open Problems in Simple Graphs and Linear Hypergraphs

Some open problems for simple graphs. ▷ Finding maximum number ... any of the non-matching edges of C than that matching edge is also ...

[2407.05264] $θ$-free matching covered graphs - arXiv

Abstract:A nontrivial connected graph is matching covered if each edge belongs to some perfect matching. For most problems pertaining to ...

The exclusive popular set problem asks if there is a popular matching in the given bipartite graph where the set of matched vertices is S, for a ...

An open Conjecture in Graph Theory - YouTube

An open Conjecture in Graph Theory: Graph Colorings and Perfect Matchings.

Some Matching Problems for Bipartite Graphs | Journal of the ACM

Ship Infrared Automatic Target Recognition Based on Bipartite Graph Recommendation: A Model-Matching Method

Open problems of Paul Erd˝os in graph theory - UCSD Math

Paul wrote many problem papers, some of which appeared in various (really hard-to-find) proceedings. Here is an attempt to collect and organize these problems ...

An NP-complete matching problem - ScienceDirect.com

We show that a restricted form of the perfect matching problem for bipartite graphs is NP-complete. The restriction involves partitions of the vertices of the ...

Graph Theory Open Problems - DIMACS

Graph Theory Open Problems · Unit Distance Graphs---chromatic number · Unit Distance Graphs---girth · Barnette's Conjecture · Crossing Number of K(9, 9) · Vertices ...

Open problems | Louis Esperet

... certain number of (not very well known) problems I was interested in at some point ... any cubic brideless graph can be covered by k k k perfect matchings. There ...

Some open problems related to eigenvalues of graphs - YouTube

Comments · Algebraic Graph Theory: Quantum walks on Cayley graphs · AGT: On the diameter and zero forcing number of some graph classes in the ...

Open Problems for the Barbados Graph Theory Workshop 2016

Two subgraphs A and B of a graph G touch if V(A) ∩ V(B) ≠ ∅, or some edge of G has one endpoint in A and the other endpoint in B. A bramble in G is a set of ...

Recent advances on Dirac-type problems for hypergraphs

Many open problems in combinatorics can be formulated as a problem of finding perfect matchings in hypergraphs, e.g., Ryser's conjecture that every Latin square ...

Open problems on graph eigenvalues studied with AutoGraphiX

Let G be a connected, unicyclic and bipartite graph on n \ge 7 vertices and G \not \cong C_n. Then E(G) \le E(\mathrm{Lol}_{n,6}). A few years later, ...

Problems

Some Web pages with mathematical problems · Open Problem Garden · Problems I like - by Matt DeVos · Problems in Topological Graph Theory maintained ...

The b-Matching problem in distance-hereditary graphs and beyond

Intriguingly, Maximum-Cardinality Matching is one of the few remaining fundamental graph problems ... We conclude in Section 5 with some open ...