Results 21 to 30 of about 909,888 (305)
Puls – musik- och dansetnologisk tidskrift, 2023 The articles in this journal issue cover a wide range of topics stimulated by the term “minority.” When I was first invited to consider this topic by my Swedish colleagues back in the 1980s and 1990s, I observed and described “multiculturalism” as a way a nation-state could control the definition of a swelling group of newcomers from other countries ...
openaire +1 more source
BMC Public Health, 2023 Background Delays in health care have been observed in the U.S. during the COVID-19 pandemic; however, the prevalence of inability to get needed care and potential disparities in health care access have yet to be assessed.
Stephanie A. Ponce +4 more
doaj +1 more source
Journal of Combinatorial Theory, Series B, 2014 It has been known for 30 years that posets with bounded height and with cover graphs of bounded maximum degree have bounded dimension. Recently, Streib and Trotter proved that dimension is bounded for posets with bounded height and planar cover graphs, and Joret et al.
openaire +6 more sources
MINORITY. THE MINOR-VICTIM AND THE MINOR-OFFENDER
Jurnalul de Studii Juridice, 2020 Research literature notes differently the time of the minority as compared to the time when the minor gives its assumed consent for sexual intercourse, in the latter case, the age in some jurisdictions being of 16 years old.( Taylor, Quayle,( 2003), : 3). At the international level, there was also the intention to change the biological age with the age
openaire +2 more sources
Logarithmically small minors and topological minors [PDF]
Journal of the London Mathematical Society, 2014 Mader proved that for every integer $t$ there is a smallest real number $c(t)$ such that any graph with average degree at least $c(t)$ must contain a $K_t$-minor. Fiorini, Joret, Theis and Wood conjectured that any graph with $n$ vertices and average degree at least $c(t)+ε$ must contain a $K_t$-minor consisting of at most $C(ε,t)\log n$ vertices ...
openaire +4 more sources
Journal of Combinatorial Theory, Series A, 2002 Let \(T_{n-1} (f)\) denote the \(n\times n\) Toeplitz matrix generated by the Fourier coefficients of the function \(f\) on the unit circle \(\mathbf{T}\) and let \(D_{n-1} (f)=\det T_{n-1} (f)\). The well known strong Szegö limit theorem asserts that if \(\sigma (t)=\exp \left(\sum_{n=-\infty}^\infty c_nt^n\right)\) then \(D_{n-1}(\sigma)\sim \exp ...
Daniel Bump, Persi Diaconis
openaire +2 more sources
Minority consultative bodies in Kosovo: A quest for effective emancipation or elusive participation? [PDF]
, 2011 This paper examines the extent to which effective political participation can be achieved through minority consultative bodies, and what obstacles and shortcomings can potentially occur in practice.
Gezim Visoka +3 more
core +3 more sources
Journal of Combinatorial Theory, Series B, 2016 We introduce a notion of bipartite minors and prove a bipartite analog of Wagner's theorem: a bipartite graph is planar if and only if it does not contain $K_{3,3}$ as a bipartite minor. Similarly, we provide a forbidden minor characterization for outerplanar graphs and forests.
Maria Chudnovsky +4 more
openaire +4 more sources
Poland and the Silesians : Minority rights à la carte? [PDF]
, 2013 The Silesians are an ethnic or national group that coalesced in the nineteenth century. During the subsequent century, they survived repeated divisions of their historical region of Upper Silesia among the nation-states of Czechoslovakia (or today its ...
Kamusella, Tomasz Dominik
core +1 more source
Journal of Combinatorial Theory, Series B, 2015 We say a digraph $G$ is a {\em minor} of a digraph $H$ if $G$ can be obtained from a subdigraph of $H$ by repeatedly contracting a strongly-connected subdigraph to a vertex. Here, we show the class of all tournaments is a well-quasi-order under minor containment.
Ilhee Kim, Paul D. Seymour
openaire +4 more sources