
arXiv: 1903.11170
AbstractMcCuaig proved a generation theorem for braces, and used it as the principal induction tool to obtain a structural characterization of Pfaffian braces. A brace is minimal if deleting any edge results in a graph that is not a brace. From McCuaig's brace generation theorem, we derive our main theorem that may be viewed as an induction tool for minimal braces. As an application, we prove that a minimal brace of order has size at most , when , and we provide a complete characterization of minimal braces that meet this upper bound. A similar work has already been done in the context of minimal bricks by Norine and Thomas wherein they deduce the main result from the brick generation theorem due to the same authors.
05C70, 05C75, 05C35, bipartite graphs, 2-extendable graphs, perfect matchings, Trees, braces, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), matching covered graphs
05C70, 05C75, 05C35, bipartite graphs, 2-extendable graphs, perfect matchings, Trees, braces, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), matching covered graphs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
