101,363 research outputs found
Joshua Davis: Author of Spare Parts
No full textCitation: K-State First (2016). Joshua Davis: Author of Spare Parts [Flier]. Manhattan, Kansas: K-State First.Flyer advertising Joshua Davis's author talk at Kansas State University
Steven Johnson Author Talk Poster
No full textK-State Book NetworkA poster advertising an author talk by Steven Johnson at Kansas State University on September 3, 2014. Steven Johnson's book "The Ghost Map" was the 2014-2015 common book
Vanishing codegree Tur\'{a}n density implies vanishing uniform Tur\'{a}n density
No full textFor a -uniform hypergraph (or simply -graph) , the codegree
Tur\'{a}n density is the infimum over all such
that any -vertex -graph with every -subset of contained
in at least edges has a copy of . The uniform Tur\'{a}n density
is the supremum over all such that there are
infinitely many -free -graphs satisfying that any linear-size
subhypergraph of has edge density at least . Falgas-Ravry, Pikhurko,
Vaughan and Volec [J. London Math. Soc., 2023] asked whether for every
-graph , . We provide a
positive answer to this question provided that . Our
proof relies on a random geometric construction and a new formulation of the
characterization of -graphs with vanishing uniform Tur\'{a}n density due to
Reiher, R{\"o}dl and Schacht [J. London Math. Soc., 2018]. Along the way, we
answer a question of Falgas-Ravry, Pikhurko, Vaughan and Volec about
subhypergraphs with linear minimum codegree in uniformly dense hypergraphs in
the negative.Comment: 10 page
Hypergraphs with arbitrarily small codegree Tur\'an density
No full textLet . Given a -uniform hypergraph , the minimum codegree
is the largest such that every -set of
is contained in at least edges. Given a -uniform hypergraph ,
the codegree Tur\'an density of is the smallest such that every -uniform hypergraph on vertices with
contains a copy of . Similarly as other
variants of the hypergraph Tur\'an problem, determining the codegree Tur\'an
density of a hypergraph is in general notoriously difficult and only few
results are known.
In this work, we show that for every , there is a -uniform
hypergraph with . This is in contrast to the
classical Tur\'an density, which cannot take any value in the interval
due to a fundamental result by Erd\H{o}s.Comment: 12 page
Dense H-free graphs are almost (Χ(H)-1)-partite
No full textBy using the Szemeredi Regularity Lemma, Alon and Sudakov recently
extended the classical Andrasfai-Erdos-Sos theorem to cover general graphs. We
prove, without using the Regularity Lemma, that the following stronger statement
is true.
Given any (r+1)-partite graph H whose smallest part has t vertices, there exists
a constant C such that for any given ε>0 and sufficiently large n the following is
true. Whenever G is an n-vertex graph with minimum degree
δ(G)≥(1 −
3/3r−1 + ε)n,
either G contains H, or we can delete f(n,H)≤Cn2−1/t edges from G to obtain an
r-partite graph. Further, we are able to determine the correct order of magnitude
of f(n,H) in terms of the Zarankiewicz extremal function
Catálogo Normas Legales Diario Oficial El Peruano, Dic. 1980 - Dic. 1985
No full textModifican el articulo 6° y el inciso K) del articulo 33° del Estatuto del Fondo de Promoción Turistica-FOPTUR. Documento que forma parte del “Catálogo de normas legales. Una mirada del Sector Cultura desde el Boletín del Diario El Peruano, Dic. 1980 – Dic. 1985”
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Hodnocení koncepce TUR ve městě Hodonín
No full textDiplomová práce je zaměřená na problematiku trvale udržitelného rozvoje. Věnuje se zejména hodnocení jeho koncepce na městě Hodonín a ukazuje praktickou aplikaci TUR na konkrétních projektech. Diplomová práce je členěna do čtyř kapitol. První kapitola představuje teoretickou část, v druhé kapitole je zhodnocena pozice města Hodonín ve vztahu k trvalé udržitelnosti. Třetí kapitola zpracovává základní dokumenty Hodonína vycházející z koncepce trvale udržitelného rozvoje. Čtvrtou kapitolu tvoří tři projekty realizované městem Hodonín, které představují praktickou aplikaci principů TUR
Four new species of Astenus (Eurysunius) Dejean, 1833 from Western Anatolia, Tur k ey (Coleoptera: Staphylinidae, Paederinae)
No full textAnlaş, Sinan (2015): Four new species of Astenus (Eurysunius) Dejean, 1833 from Western Anatolia, Tur k ey (Coleoptera: Staphylinidae, Paederinae). Zootaxa 3986 (4): 472-482, DOI: 10.11646/zootaxa.3986.4.
- …
