Results 11 to 20 of about 1,222,002 (199)
Two short proofs of the Perfect Forest Theorem [PDF]
Theory and Applications of Graphs, 2017 A perfect forest is a spanning forest of a connected graph $G$, all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest.
Yair Caro, Josef Lauri, Christina Zarb
doaj +2 more sources
On characterizing proper max-point-tolerance graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Max-point-tolerance graphs (MPTG) were introduced by Catanzaro et al. in 2017 as a generalization of interval graphs. This graph class has many practical applications in the study of the human genome as well as in signal processing for networks. The same
Sanchita Paul
doaj +1 more source
Experimental test of the Greenberger–Horne–Zeilinger-type paradoxes in and beyond graph states
npj Quantum Information, 2021 The Greenberger–Horne–Zeilinger (GHZ) paradox is an exquisite no-go theorem that shows the sharp contradiction between classical theory and quantum mechanics by ruling out any local realistic description of quantum theory.
Zheng-Hao Liu +11 more
doaj +1 more source
Matchings and Hamilton cycles in hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 It is well known that every bipartite graph with vertex classes of size $n$ whose minimum degree is at least $n/2$ contains a perfect matching. We prove an analogue of this result for uniform hypergraphs. We also provide an analogue of Dirac's theorem on
Daniela Kühn, Deryk Osthus
doaj +1 more source
Towards a Constructive Formalization of Perfect Graph Theorems [PDF]
, 2019 ICLA ...
Abhishek Kr Singh, Raja Natarajan
openaire +2 more sources
Electronic Journal of Graph Theory and Applications, 2017 In decomposition theory, extreme sets have been studied extensively due to its connection to perfect matchings in a graph. In this paper, we first define extreme sets with respect to degree-matchings and next investigate some of their properties.
Radosław Cymer
doaj +1 more source
Planar cycle-extendable graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceFor most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching.
Aditya Y Dalwadi +3 more
doaj +1 more source
Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, “A Generalization of the Perfect Graph Theorem Under the Disjunctive Index” [PDF]
Mathematics of Operations Research, 2003 We give short elementary proofs of two results by N. E. Aguilera, M. S. Escalante, and G. L. Nasini on the disjunctive index of the clique relaxation of the stable set polytope.
Gerards, A.H. +2 more
openaire +5 more sources
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs [PDF]
, 2019 A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based on a branch decomposition. It was introduced by Norine and intended as a tool for the structural study of matching covered graphs, especially in the context of Pfaffian ...
Meike Hatzel +2 more
openaire +4 more sources
Testing hereditary properties of nonexpanding bounded-degree graphs [PDF]
, 2007 We study graph properties that are testable for bounded-degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It
Christian Sohler +5 more
core +1 more source