Results 51 to 60 of about 14,970 (213)
Extremal, enumerative and probabilistic results on ordered hypergraph matchings
Forum of Mathematics, SigmaAn ordered r-matching is an r-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of r-dimensional orders.
Michael Anastos +3 more
doaj +1 more source
Symmetric 2‐( 35 , 17 , 8 ) $(35,17,8)$ Designs With an Automorphism of Order 2
Journal of Combinatorial Designs, EarlyView.ABSTRACT The largest prime p $p$ that can be the order of an automorphism of a 2‐( 35 , 17 , 8 ) $(35,17,8)$ design is p = 17 $p=17$, and all 2‐( 35 , 17 , 8 ) $(35,17,8)$ designs with an automorphism of order 17 were classified by Tonchev. The symmetric 2‐( 35 , 17 , 8 ) $(35,17,8)$ designs with automorphisms of an odd prime order p < 17 $p\lt 17 ...
Sanja Rukavina, Vladimir D. Tonchev
wiley +1 more source
Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems
Journal of Graph Theory, EarlyView.ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh +2 more
wiley +1 more source
On the Turan number of forests [PDF]
, 2012 The Turan number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. We determine the Turan number and find the unique extremal graph for forests consisting of paths when n is sufficiently ...
Lidický, Bernard +2 more
core
Trees with the most subtrees -- an algorithmic approach
, 2012 When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in applications.
Gray, Daniel +3 more
core +1 more source
Additive energies on discrete cubes
Discrete Analysis, 2023 One definition of additive combinatorics is that it is the study of subsets of (usually Abelian) groups. Two much studied parameters associated with a subset $A$ are the size of its sumset $A+A=\{a+b:a,b\in A\}$ (or the product set $A.A=\{a.b:a,b\in A\}$
Jaume de Dios Pont +3 more
doaj +1 more source
Abundant Neighborhoods, Two‐Sided Markets, and Maximal Matchings
Naval Research Logistics (NRL), EarlyView.ABSTRACT I introduce a new graph‐theoretic property called abundant neighborhoods. This property is motivated by studying the thickness of economic markets. A vertex is, roughly, guaranteed to match if and only if it has an abundant neighborhood.
Muhammad Maaz
wiley +1 more source
Forbidden intersection problems for families of linear maps
Discrete Analysis, 2023 Forbidden intersection problems for families of linear maps, Discrete Analysis 2023:19, 32 pp. A central problem in extremal combinatorics is to determine the maximal size of a set system given constraints on the sizes of the sets in the system and on ...
David Ellis, Guy Kindler, Noam Lifshitz
doaj +1 more source
Spaceborne and spaceborn: Physiological aspects of pregnancy and birth during interplanetary flight
Experimental Physiology, EarlyView.Abstract Crewed interplanetary return missions that are on the planning horizon will take years, more than enough time for initiation and completion of a pregnancy. Pregnancy is viewed as a sequence of processes – fertilization, blastocyst formation, implantation, gastrulation, placentation, organogenesis, gross morphogenesis, birth and neonatal ...
Arun V. Holden
wiley +1 more source
Gowers norms for automatic sequences
Discrete Analysis, 2023 Gowers norms for automatic sequences, Discrete Analysis 2023:4, 62 pp. There are several situations in additive and extremal combinatorics where it is useful to decompose an object $X$ into a "structured" part $S(X)$ and a "quasirandom" part $Q(X)$.
Jakub Byszewski +2 more
doaj +1 more source