Results 91 to 100 of about 1,222,002 (199)
Exploring 2D Geometric Shape Classification Using AI‐Driven Feature Tables in Mathematics
School Science and Mathematics, EarlyView.ABSTRACT This study explored the effectiveness of an AI‐integrated instructional task designed to enhance preservice teachers' understanding of the features and hierarchical relationships of 2D geometric shapes. Originally developed and tested in online K‐12 professional development settings, this intervention was adapted for in‐person preservice ...
Yasemin Gunpinar, Woonhee Sung
wiley +1 more source
The Additive Logic of Epistemic Reasons: An Axiomatic Account
Theoria, EarlyView.ABSTRACT The article argues for a system of axioms that is meant to capture the logic of normative reasons for belief. The system concerns a primitive direct‐reason relation, a defined doxastic‐reason relation, and a primitive function for the revision of rational belief by reasons.
Hannes Leitgeb
wiley +1 more source
In his 1987 entry on ‘Perfect Competition’ in The New Palgrave, the author reviewed the question of the perfectness of perfect competition, and gave four alternative formalisations rooted in the so-called Arrow-Debreu-Mckenzie model.
M. Ali Khan
core +2 more sources
, 1965 Menger's Theorem asserts that if x and y are vertices of a graph which are not joined by an edge and if it takes at least k other vertices to separate x and y, then x and y can be joined by k distinct arcs in the graph whic h have only their end-vertices
Tutte, W. T.
core +1 more source
Vessel arrival planning with full information
International Transactions in Operational Research, Volume 34, Issue 1, Page 372-396, January 2027.Abstract Planning efficiency and timely arrival of vessels is crucial to smooth operations of maritime transport networks, ensuring optimal utilization of resources and minimizing operational costs. Coordination between vessel operators and terminals has the potential to reduce costs, fuel consumption, and waiting time.
Pim Willem Antoon van Leeuwen +1 more
wiley +1 more source
In this paper we introduce a new concept, that of hybrid base, which is a maximal circuitless and cutsetless subset of a graph. Although this concept of simultaneous circuitlessness and cutsetlessness has been used in proofs of some theorems in so called
Gibbons, Alan, Novak, Ladislav
core
Mixed Steiner Triple Systems With Shortest Length
Journal of Combinatorial Designs, Volume 34, Issue 12, Page 533-544, December 2026.ABSTRACT A mixed Steiner triple system is a 3‐GDD which is viewed as a code with minimum Hamming distance 3. These codes are the minimum weight codewords of a 1‐perfect code over a mixed alphabet, when the related codes exist, and provide the connection between 3‐GDDs and coding theory.
Tuvi Etzion
wiley +1 more source
A generalization of the perfect graph theorem under the disjunctive index
, 2008 In this paper we relate antiblocker duality between polyhedra, graph theory and the disjunctive procedure. In particular, we analyze the be-havior of the disjunctive procedure over the clique relaxation, K(G), of the stable set polytope in a graph G and ...
Néstor E. Aguilera +2 more
core
Density Conditions for k Vertex‐Disjoint Triangles in Tripartite Graphs
Journal of Graph Theory, Volume 113, Issue 4, Page 634-649, December 2026.ABSTRACT Let n , k be positive integers such that n ≥ k and G be a tripartite graph with parts A , B , C such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n. Denote the edge densities of G [ A , B ] , G [ A , C ] and G [ B , C ] by α , β and γ, respectively. In this paper, we study edge density conditions for the existence of k vertex‐disjoint triangles in a ...
Mingyang Guo, Klas Markström
wiley +1 more source
Journal of Graph Theory, Volume 113, Issue 4, Page 553-570, December 2026.ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]. We take
Yixin Cao, Shenghua Wang
wiley +1 more source