Results 11 to 20 of about 116,505 (190)
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.
A.M.H. Gerards +2 more
openalex +5 more sources
The Flat Wall Theorem for Bipartite Graphs with Perfect Matchings
, 2021 Matching minors are a specialised version of minors fit for the study of graphs with perfect matchings. The first major appearance of matching minors was in a result by Little who showed that a bipartite graph is Pfaffian if and only if it does not contain \(K_{3,3}\) as a matching minor.
Archontia C. Giannopoulou +1 more
openalex +3 more sources
A theorem about a conjecture of H. Meyniel on kernel-perfect graphs
Discrete Mathematics, 1986 An R-digraph (also called kernel-perfect graph) is a digraph such that all of its induced subdigraphs possess a kernel (that is an independent dominating subset). Meyniel's conjecture (suggested in the title) is that D is an R-digraph if all odd directed cycles of D possess two pseudodiagonals (a pseudo-diagonal is an arc which is not part of the cycle
Hortensia Galeana‐Sánchez
openalex +2 more sources
Anticoncentration of Random Vectors via the Strong Perfect Graph Theorem
CombinatoricaIn this paper we give anticoncentration bounds for sums of independent random vectors in finite-dimensional vector spaces. In particular, we asymptotically establish a conjecture of Leader and Radcliffe (1994) and a question of Jones (1978). The highlight of this work is an application of the strong perfect graph theorem by Chudnovsky, Robertson ...
Tomas Juškevičius, Valentas Kurauskas
openalex +4 more sources
The strong perfect graph theorem [PDF]
, 2019 Stephan Ramon Garcia, Steven Miller
openalex +2 more sources
Perfect Matching in Random Graphs is as Hard as Tseitin [PDF]
TheoretiCS, 2022 We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times.
Per Austrin, Kilian Risse
doaj +1 more source
An Even 2-Factor in the Line Graph of a Cubic Graph
Theory and Applications of Graphs, 2022 An even 2-factor is one such that each cycle is of even length. A 4- regular graph G is 4-edge-colorable if and only if G has two edge-disjoint even 2- factors whose union contains all edges in G.
SeungJae Eom, Kenta Ozeki
doaj +1 more source
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