Some open problems in matchings in graphs

M is k-matching ⇐⇒ #M = k. Shmuel Friedland Univ. Illinois at Chicago () Some open problems in matchings in graphs. BIRS, February 1, 2011.

Lower bounds on permanents and haffnians: results and conjectures. Shmuel Friedland Univ. Illinois at Chicago () Some open problems in matchings ...

$P$-Matchings in Graphs: A Brief Survey with Some Open Problems

Title:P-Matchings in Graphs: A Brief Survey with Some Open Problems ... Abstract:For a graph G=(V,E), a matching M is a set of independent edges.

P$-Matchings in Graphs: A Brief Survey with Some Open Problems

PDF | For a graph $G=(V,E),$ a matching $M$ is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many.

What are currently the most important open problems in graph theory?

The classification of distance-transitive graphs is an arguably interesting and important open problem in algebraic graph theory. · It is now ...

ELA - University of Wyoming Open Journals

da Fonseca. This is an expanded version of the lecture “Some open problems in matchings in graphs”, Directions in Matrix Theory 2011 ...

A study of Matchings in Graphs - cs.wisc.edu

One of the celebrated results by Jack Ed- monds showed that the matching problem in any general graphs yields itself to a polynomial ... A long standing open ...

Collection of conjectures and open problems in graph theory

The largest section in the open problem garden is about graph theory. The book Erdös on Graphs with its living version might be interesting ...

some open problems - University of Washington

I proved (Journal of Graph Theory) that if there are large subsets W such that the equation holds for many different eigenvectors k, then the ...

Problems on matchings and independent sets of a graph

In this paper, we prove a conjecture which states that for any graph the number of inclusion minimal independent set S with d ( S ) > 0 is at least the critical ...

Open problems related to locality in distributed graph algorithms

Here are some examples of concrete questions: Can we find a maximal matching in bipartite graphs with ...

Some Open Problems in Computational Geometry - DROPS

Here it comes the open problem: for given U, can we compute in near-linear time a maximum matching in the intersection graph GU ? Together with Édouard Bonnet ...

On Two Unsolved Problems Concerning Matching Covered Graphs

In order to prove this, we first show that any nonsolid brick has one of the four graphs C6, the bicorn, the tricorn, and the Petersen graph as a conformal ...

Exponentially many perfect matchings in cubic graphs (Solved)

Open Problem Garden · Exponentially many perfect matchings in cubic graphs (Solved).

Some Open Problems - Illinois Institute of Technology

Problem 2. New ideas for upper bounds on l(G). Hemanshu Kaul. Page 22. Delay Edge Coloring. Max Bipartite Subgraphs. Graph Packing. Open Questions. Modify the ...

Results and open problems in matchings in regular graphs

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 the ...

4.5Matching in Bipartite Graphs

Draw as many fundamentally different examples of bipartite graphs which do NOT have matchings. Your goal is to find all the possible obstructions to a graph ...

Problems in Graph Theory and Combinatorics - Douglas B. West's

Note: Here is a discussion of the notation for the number of vertices and the number of edges of a graph G. Other directories of open problems pages can be ...

An open problem in Graph Theory - YouTube

The problem specifically forms a bridge between quantum mechanics and graph theory. This video talks about how a problem inspired from ...

Results and open problems in matchings in regular graphs

Results and open problems in matchings in regular graphs ... Make a Submission. Make a Submission. Electronic Journal of Linear Algebra. A publication of the ...