Zobrazeno 1 - 10
of 115
pro vyhledávání: '"Sharifzadeh Maryam"'
Autor:
Moradi Leila, Hashemi Sayed Jalal, Zaman Ferdos, Alipour Meysam, Farhangiyan Zahra, Sharifzadeh Maryam
Publikováno v:
Romanian Journal of Internal Medicine, Vol 62, Iss 3, Pp 260-271 (2024)
In this study, we aimed to compare metabolic risk factors, lipid indices, healthy eating index, and physical activity among premenopausal, menopausal, and postmenopausal women.
Externí odkaz:
https://doaj.org/article/347df641b5914d3ca2476badfc57fb48
Let $G$ be an $r$-partite graph such that the edge density between any two parts is at least $\alpha$. How large does $\alpha$ need to be to guarantee that $G$ contains a connected transversal, that is, a tree on $r$ vertices meeting each part in one
Externí odkaz:
http://arxiv.org/abs/2305.05713
For a fixed poset $P$, a family $\mathcal F$ of subsets of $[n]$ is induced $P$-saturated if $\mathcal F$ does not contain an induced copy of $P$, but for every subset $S$ of $[n]$ such that $ S\not \in \mathcal F$, $P$ is an induced subposet of $\ma
Externí odkaz:
http://arxiv.org/abs/2207.03974
Publikováno v:
In Environmental and Sustainability Indicators December 2024 24
Combining two classical notions in extremal combinatorics, the study of Ramsey-Tur\'an theory seeks to determine, for integers $m\le n$ and $p \leq q$, the number $\mathsf{RT}_p(n,K_q,m)$, which is the maximum size of an $n$-vertex $K_q$-free graph i
Externí odkaz:
http://arxiv.org/abs/2103.10423
Publikováno v:
J. London Math. Soc.(2) 2023, 108:1121--1162
We present a sufficient condition for the stability property of extremal graph problems that can be solved via Zykov's symmetrisation. Our criterion is stated in terms of an analytic limit version of the problem. We show that, for example, it applies
Externí odkaz:
http://arxiv.org/abs/2012.10731
Publikováno v:
Discrete Analysis 2023:8
We develop a limit theory of Latin squares, paralleling the recent limit theories of dense graphs and permutations. We introduce a notion of density, an appropriate version of the cut distance, and a space of limit objects - so-called Latinons. Key r
Externí odkaz:
http://arxiv.org/abs/2010.07854
Autor:
Chan, Timothy F. N., Kral, Daniel, Noel, Jonathan A., Pehova, Yanitsa, Sharifzadeh, Maryam, Volec, Jan
It is known that a sequence Pi_i of permutations is quasirandom if and only if the pattern density of every 4-point permutation in Pi_i converges to 1/24. We show that there is a set S of 4-point permutations such that the sum of the pattern densitie
Externí odkaz:
http://arxiv.org/abs/1909.11027
Publikováno v:
Discrete Analysis, 2020:19, 26pp
The famous Erd\H{o}s-Rademacher problem asks for the smallest number of $r$-cliques in a graph with the given number of vertices and edges. Despite decades of active attempts, the asymptotic value of this extremal function for all $r$ was determined
Externí odkaz:
http://arxiv.org/abs/1906.05942
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.