36 research outputs found
Single Commodity Flow Algorithms for Lifts of Graphic and Cographic Matroids
Consider a binary matroid M given by its matrix representation. We show that if M is a lift of a graphic or a cographic matroid, then in polynomial time we can either solve the single commodity flow problem for M or find an obstruction for which the Max-Flow Min-Cut relation does not hold. The key tool is an algorithmic version of Lehman's Theorem for the set covering polyhedron
Three-cuts are a charm: acyclicity in 3-connected cubic graphs
Let be a bridgeless cubic graph. In 2023, the three authors solved a
conjecture (also known as the -Conjecture) made by Mazzuoccolo in 2013:
there exist two perfect matchings of such that the complement of their
union is a bipartite subgraph of . They actually show that given any
-factor (a spanning subgraph of such that its vertices have degree
at least 1) and an arbitrary edge of , there exists a perfect matching
of containing such that is bipartite. This
is a step closer to comprehend better the Fan--Raspaud Conjecture and
eventually the Berge--Fulkerson Conjecture. The -Conjecture, now a
theorem, is also the weakest assertion in a series of three conjectures made by
Mazzuoccolo in 2013, with the next stronger statement being: there exist two
perfect matchings of such that the complement of their union is an acyclic
subgraph of . Unfortunately, this conjecture is not true: Jin, Steffen, and
Mazzuoccolo later showed that there exists a counterexample admitting 2-cuts.
Here we show that, despite of this, every cyclically 3-edge-connected cubic
graph satisfies this second conjecture.Comment: 21 pages, 12 figures. arXiv admin note: text overlap with
arXiv:2204.1002
Desenvolvimentos da Conjetura de Fulkerson
Orientador: Christiane Neme CamposDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: Em 1971, Fulkerson propôs a seguinte conjetura: todo grafo cúbico sem arestas de corte admite seis emparelhamentos perfeitos tais que cada aresta do grafo pertence a exatamente dois destes emparelhamentos. A Conjetura de Fulkerson tem desafiado pesquisadores desde sua publicação. Esta conjetura é facilmente verificada para grafos cúbicos 3-aresta-coloráveis. Portanto, a dificuldade do problema reside em estabelecer a conjetura para grafos cúbicos sem arestas de corte que não possuem 3-coloração de arestas. Estes grafos são chamados snarks. Nesta dissertação, a Conjetura de Fulkerson e os snarks são introduzidos com ¿ênfase em sua história e resultados mais relevantes. Alguns resultados relacionados à Conjetura de Fulkerson são apresentados, enfatizando suas conexões com outras conjeturas. Um breve histórico do Problema das Quatro Cores e suas relações com snarks também são apresentados. Na segunda parte deste trabalho, a Conjetura de Fulkerson é verificada para algumas famílias infinitas de snarks construídas com o método de Loupekine, utilizando subgrafos do Grafo de Petersen. Primeiramente, mostramos que a família dos LP0-snarks satisfaz a Conjetura de Fulkerson. Em seguida, generalizamos este resultado para a família mais abrangente dos LP1-snarks. Além disto, estendemos estes resultados para Snarks de Loupekine construídos com subgrafos de snarks diferentes do Grafo de PetersenAbstract: In 1971, Fulkerson proposed a conjecture that states that every bridgeless cubic graph has six perfect matchings such that each edge of the graph belongs to precisely two of these matchings. Fulkerson's Conjecture has been challenging researchers since its publication. It is easily verified for 3-edge-colourable cubic graphs. Therefore, the difficult task is to settle the conjecture for non-3-edge-colourable bridgeless cubic graphs, called snarks. In this dissertation, Fulkerson's Conjecture and snarks are presented with emphasis in their history and remarkable results. We selected some results related to Fulkerson's Conjecture, emphasizing their reach and connections with other conjectures. It is also presented a brief history of the Four-Colour Problem and its connections with snarks. In the second part of this work, we verify Fulkerson's Conjecture for some infinite families of snarks constructed with Loupekine's method using subgraphs of the Petersen Graph. More specifically, we first show that the family of LP0-snarks satisfies Fulkerson's Conjecture. Then, we generalise this result by proving that Fulkerson's Conjecture holds for the broader family of LP1-snarks. We also extend these results to even more general Loupekine Snarks constructed with subgraphs of snarks other than the Petersen GraphMestradoCiência da ComputaçãoMestre em Ciência da Computaçã
Notes in Pure Mathematics & Mathematical Structures in Physics
These Notes deal with various areas of mathematics, and seek reciprocal
combinations, explore mutual relations, ranging from abstract objects to
problems in physics.Comment: Small improvements and addition
Multidimensional Graphical Representations by Chernoff-Type Faces in Color: Assigning Data Coordinates to Face Parameters through Principal Component Analysis
A new Chernoff-type face in color has been developed for purposes of representing and analyzing multidimensional data. This cartoon-like but fairly realistic face is defined by 20 parameters, including 4 color parameters. The programming was done in extended BASIC on the Hewlett-Packard 9845C color graphics computer. A method based on the mean pooled variances of parameter values within observed clusters was developed in order to establish an empirical rank order of importance among the face parameters. It was found experimentally that the smile, the outline of the face, and certain eye parameters were among the most important. Using a model consisting of a mixture of multivariate normal distributions, data were generated artificially from four known populations in order to compare different schemes for assigning data coordinates to face parameters. Five different schemes were experimentally evaluated with regard to their ability to recover known clusterings. The five methods were compared with one another, with random clusterings, and with the results of applying numerical algorithms to the artificial data. The assignment scheme best able experimentally to recover the known clustering was one where principal component scores were used to construct the faces rather than the original, raw data. Numerical algorithms which operated on the component scores were also generally superior to those operating on the original data. Using the new faces, a method was developed to cluster variables rather than the customary clustering of cases. This was compared with the clustering of variables through principal component analysis (varimax orthogonal rotations), and with numerical clustering algorithms which use the product moment correlation as a similarity measure. A data set consisting of psychological profiles of nine entering classes of physicians in a Family Medicine residency was utilized to illustrate some of the foregoing, and also to depict and analyze changes over time of entering class characteristics
LIPIcs, Volume 274, ESA 2023, Complete Volume
LIPIcs, Volume 274, ESA 2023, Complete Volum
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)
The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..