Results 21 to 30 of about 615,758 (305)
Counting Intersecting and Pairs of Cross-Intersecting Families [PDF]
A family of subsets of {1,. . .,n} is calledintersectingif any two of its sets intersect. A classical result in extremal combinatorics due to Erdős, Ko and Rado determines the maximum size of an intersecting family ofk-subsets of {1,. . .,n}. In this paper we study the following problem: How many intersecting families ofk-subsets of {1,. .
Frankl, Péter, Kupavskii, Andrey
openaire +5 more sources
Cycling is a sustainable and healthy mode of transportation with direct links to reducing traffic congestion, lowering greenhouse gas emissions, and improving air quality.
Shamsunnahar Yasmin (11237904) +2 more
core +2 more sources
Objective. The aim of the study was to determine an association between the plasma YKL-40 level and echocardiographic left ventricle systolic and diastolic function parameters in patients with acute myocardial infarction. Subjects and Methods.
Selcuk Pala +5 more
doaj +1 more source
Development of alternatives for Signalized intersection- A Case study of Laxmi Mill junction, Coimbatore [PDF]
Urbanization and industrialization are two of the most important features of modern civilization. This leads to traffic congestion at the major roads of urbanized areas.
Indhiradevi P. +5 more
doaj +1 more source
The Intersection Structure of $t$-Intersecting Families [PDF]
A family of sets is $t$-intersecting if any two sets from the family contain at least $t$ common elements. Given a $t$-intersecting family of $r$-sets from an $n$-set, how many distinct sets of size $k$ can occur as pairwise intersections of its members? We prove an asymptotic upper bound on this number that can always be achieved.
openaire +3 more sources
Introduction to Intersection Theory [PDF]
openIntersection theory is a fundamental tool in algebraic geometry to study the geometry of algebraic varieties. The aim of this thesis is to provide a comprehensive and rigorous introduction to intersection theory by following William Fulton’s classic ...
SCHIAVONE, LORENZO
core
Summary: Let \(G\) and \(H\) be two graphs of order \(n\). If we place copies of \(G\) and \(H\) on a common vertex set, how much or little can they be made to overlap? The aim of this article is to provide some answers to this question, and to pose a number of related problems. Along the way, we solve a conjecture of \textit{P. Erdős} et al. [ibid. 12,
Bollobas, B, Scott, A
openaire +1 more source
Consider two regions in the plane, bounded by an $n$-gon and an $m$-gon, respectively. At most how many connected components can there be in their intersection? This question was asked by Croft. We answer this asymptotically, proving the bounds $$\left\lfloor \frac{m}{2}\right\rfloor \cdot \left\lfloor \frac{n}{2}\right\rfloor\le f(n,m)\le \left\lfloor
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yair Caro, Raphael Yuster
openaire +1 more source
Reliable and Seamless Communications of Networked IAV in Container Terminal Using UAV Technology
Managing container loading and unloading operations at a container terminal using Intelligent Autonomous Vehicle (IAV) is challenging, especially at intersections in the yard, which are often inevitable.
Bahnes Nacera +2 more
doaj +1 more source

