11 research outputs found
Note on power hypergraphs with equal domination and matching numbers
We present some examples that refute two recent results in the literature
concerning the equality of the domination and matching numbers for power and
generalized power hypergraphs. In this note we pinpoint the flaws in the proofs
and suggest how they may be mended.Comment: 7 pages, 1 figure, XIII Encuentro Andaluz de Matem\'atica Discreta,
(C\'adiz) Spain, july, 202
Sufficient degree conditions for graph embeddings
In this dissertation, we focus on the sufficient conditions to guarantee one graph being the subgraph of another. In Chapter 2, we discuss list packing, a modification of the idea of graph packing. This is fitting one graph in the complement of another graph. Sauer and Spencer showed a sufficient bound involving maximum degrees, and this was further explored by Kaul and Kostochka to characterize all extremal cases. Bollobas and Eldridge (and independently Sauer and Spencer) developed edge sum bounds to guarantee packing.
In Chapter 2, we introduce the new idea of list packing and use it to prove stronger versions of many existing theorems. Namely, for two graphs, if the product of the maximum degrees is small or if the total number of edges is small, then the graphs pack.
In Chapter 3, we discuss the problem of finding k vertex-disjoint cycles in a multigraph. This problem originated from a conjecture of Erdos and has led to many different results. Corradi and Hajnal looked at a minimum degree condition. Enomoto and Wang independently looked at a minimum degree-sum condition. More recently, Kierstead, Kostochka, and Yeager characterized the extremal cases to improve these bounds. In Chapter 3, we improve on the multigraph degree-sum result. We characterize all multigraphs that have simple Ore-degree at least 4k -3 , but do not contain k vertex-disjoint cycles. Moreover, we provide a polynomial time algorithm for deciding if a graph contains k vertex-disjoint cycles.
Lastly, in Chapter 4, we consider the same problem but with chorded cycles. Finkel looked at the minimum degree condition while Chiba, Fujita, Gao, and Li addressed the degree-sum condition. More recently, Molla, Santana, and Yeager improved this degree-sum result, and in Chapter 4, we will improve on this further
Forbidden subgraphs and the König-Egerváry property
The matching number of a graph is the maximum size of a set of vertex-disjoint edges. The transversal number is the minimum number of vertices needed to meet every edge. A graph has the König-Egerváry property if its matching number equals its transversal number. Lovász proved a characterization of graphs having the König-Egerváry property by means of forbidden subgraphs within graphs with a perfect matching. Korach, Nguyen, and Peis proposed an extension of Lovász's result to a characterization of all graphs having the König-Egerváry property in terms of forbidden configurations (which are certain arrangements of a subgraph and a maximum matching). In this work, we prove a characterization of graphs having the König-Egerváry property by means of forbidden subgraphs which is a strengthened version of the characterization by Korach et al. Using our characterization of graphs with the König-Egerváry property, we also prove a forbidden subgraph characterization for the class of edge-perfect graphs. © 2013 Elsevier B.V. All rights reserved.Fil:Bonomo, F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.Fil:Durán, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.Fil:Grippo, L.N. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.Fil:Safe, M.D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina
Forbidden subgraphs and the König–Egerváry property
The matching number of a graph is the maximum size of a set of vertex-disjoint edges. The transversal number is the minimum number of vertices needed to meet every edge. A graph has the König-Egerváry property if its matching number equals its transversal number. Lovász proved a characterization of graphs having the König-Egerváry property by means of forbidden subgraphs within graphs with a perfect matching. Korach, Nguyen, and Peis proposed an extension of Lovász´s result to a characterization of all graphs having the König-Egerváry property in terms of forbidden configurations (which are certain arrangements of a subgraph and a maximum matching). In this work, we prove a characterization of graphs having the König-Egerváry property by means of forbidden subgraphs which is a strengthened version of the characterization by Korach et al. Using our characterization of graphs with the König-Egerváry property, we also prove a forbidden subgraph characterization for the class of edge-perfect graphs.Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de ComputaciĂłn; Argentina. Consejo Nacional de Investigaciones CientĂficas y TĂ©cnicas; ArgentinaFil: Dourado, Mitre C.. Universidade Federal do Rio de Janeiro; BrasilFil: Duran, Guillermo Alfredo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Universidad de Chile; Chile. Consejo Nacional de Investigaciones CientĂficas y TĂ©cnicas; ArgentinaFil: Faria, Luerbio. Universidade do Estado do Rio de Janeiro; BrasilFil: Grippo, Luciano Norberto. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones CientĂficas y TĂ©cnicas; ArgentinaFil: Safe, Martin Dario. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones CientĂficas y TĂ©cnicas; Argentin