Results 81 to 90 of about 11,124 (213)
How to pick your football team
Mathematika, Volume 72, Issue 4, October 2026.Abstract Team captains Alice and Bob divide up 2m$2m$ footballers, each reduced to a real‐valued score, into two teams of m$m$ footballers each. On each turn, one captain plays picker, and the other chooser: the picker names a footballer yet to be selected, and the chooser decides which captain's team receives that footballer.
Bhargav Narayanan
wiley +1 more source
Enumeration of hypergraphs [PDF]
, 1983 Formulae for the generating functions for hypergraphs, dihypergraphs, oriented hypergraphs, selfcomplementary directed hypergraphs and self complementary hypergraphs are presented ...
Hegde, M, Sridharan, MR
core
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, Volume 113, Issue 1, Page 88-96, September 2026.ABSTRACT Chvátal showed that for any tree T with k edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1. For r = 3 or 4, we show that, if T is an r‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ). The 3‐uniform result comes from observing a construction of Cooper and Mubayi.
Jiaxi Nie
wiley +1 more source
Learning from high-order data: hypergraphs and smart codes
, 2023 Arce, Gonzalo R.Currently, there is an increasing need to develop tools that allow the processing and exploitation of the massive amount of data available in many fields, such as computer vision, biology, social sciences, computational image, and others.
Pena Pena, Karelia
core +1 more source
On the separability of elements and sets in hypergraphs of models of a theory
Қарағанды университетінің хабаршысы. Математика сериясы, 2016 We consider topological properties of hypergraphs of models of a theory. The separability of elements in these hypergraphs is characterized in terms of algebraic closures. Similarly we specify the separability of sets by the hypergraphs.
S.V. Sudoplatov
doaj
Hypergraph Representation via Axis-Aligned Point-Subspace Cover [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for short.
Oksana Firman, Joachim Spoerhase
doaj +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source
Land Degradation &Development, Volume 37, Issue 15, Page 10672-10696, September 2026.ABSTRACT The use of Land Use Land Cover (LULC) analysis is a fundamental requirement for urban solid waste management (SWM); however, conventional LULC analysis methods are not well suited to the spatio‐temporal variability, multi‐sensor heterogeneity, and seasonal variations of highly dynamic urban environments.
Rubeena Vohra, Ashish Kumar
wiley +1 more source
Topology and its Applications, 2011 We investigate a family of polytopes introduced by E.M.\ Feichtner, A.\ Postnikov and B.\ Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as constructions of hypergraphs. Limit cases in this family of polytopes are, on the one end, simplices, and, on the other end, permutohedra.
Došen, Kosta, Petrić, Zoran
openaire +3 more sources
The Uniformity Space of Hypergraphs
, 2012 For a hypergraph H=(V,E) and a field F, a weighting of H is a map f:V ?F. A weighting is called stable if there is some k ? F such that the sum of the weights on each edge of H is equal to k.
Mol, Lucas
core