Results 21 to 30 of about 2,688,347 (211)
On the heapability of finite partial orders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing such a ...
János Balogh +4 more
doaj +1 more source
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n vertices. Those hypergraphs (and their minimal transversals) are commonly found in database applications.
Alexandre Bazin +3 more
doaj +1 more source
The agreement distance of unrooted phylogenetic networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A rearrangement operation makes a small graph-theoretical change to a phylogenetic network to transform it into another one. For unrooted phylogenetic trees and networks, popular rearrangement operations are tree bisection and reconnection (TBR) and ...
Jonathan Klawitter
doaj +1 more source
On the shelling antimatroids of split graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids.
Jean Cardinal +2 more
doaj +1 more source
JOHME: Journal of Holistic Mathematics Education, 2023 Learning combinatorics material requires a digital learning medium that is able to support students' independent learning. The unavailability of digital media makes students experience difficulties, so independent learning cannot be carried out ...
Indah Riezky Pratiwi +4 more
semanticscholar +1 more source
Constructive Combinatorics in Elementary School Mathematics
Doklady. Mathematics, 2023 The paper describes in detail a class of educational problems from an elementary school course of mathematics and computer science. This course has been implemented over the past decades by a team led by Academician of the RAS A.L. Semenov.
M. A. Posicelskaya
semanticscholar +1 more source
ZDM – Mathematics Education, 2022 In this case study, we investigate one teacher’s implementation of DNR-based combinatorics curriculum in their high school discrete mathematics class. By examining the teacher’s practices in whole-class discussions of two counting problems, we study how ...
Osvaldo D. Soto, Kris Siy, G. Harel
semanticscholar +1 more source
Stable gonality is computable [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the minimum number
Ragnar Groot Koerkamp +1 more
doaj +1 more source
Taking-and-merging games as rewrite games [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 This work is a contribution to the study of rewrite games. Positions are finite words, and the possible moves are defined by a finite number of local rewriting rules.
Eric Duchêne +3 more
doaj +1 more source
Bringing a CURE into a Discrete Mathematics Course and Beyond
The Mathematics Enthusiast, 2022 Course-based Undergraduate Research Experiences (CUREs) have been well developed in the hard sciences, but math CUREs are all but absent from the literature.
Lipika Deka +2 more
semanticscholar +1 more source