Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "copies" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-7 z 7
    Tytuł:
    Vertex-disjoint stars in graphs
    Autorzy:
    Ota, Katsuhiro
    Powiązania:
    https://bibliotekanauki.pl/articles/743470.pdf
    Data publikacji:
    2001
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    stars
    vertex-disjoint copies
    minimum degree
    Opis:
    In this paper, we give a sufficient condition for a graph to contain vertex-disjoint stars of a given size. It is proved that if the minimum degree of the graph is at least k+t-1 and the order is at least (t+1)k + O(t²), then the graph contains k vertex-disjoint copies of a star $K_{1,t}$. The condition on the minimum degree is sharp, and there is an example showing that the term O(t²) for the number of uncovered vertices is necessary in a sense.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2001, 21, 2; 179-185
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Anti-Ramsey numbers for disjoint copies of graphs
    Autorzy:
    Gorgol, I.
    Gorlich, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/255048.pdf
    Data publikacji:
    2017
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    anti-Ramsey number
    rainbow number
    disjoint copies
    Opis:
    A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. For a graph G and a positive integer n, the anti-Ramsey number ar(n,G) is the maximum number of colors in an edge-coloring of Kn with no rainbow copy of H. Anti-Ramsey numbers were introduced by Erdos, Simonovits and Sós and studied in numerous papers. Let G be a graph with anti-Ramsey number ar(n, G). In this paper we show the lower bound for ar(n,pG), where pG denotes p vertex-disjoint copies of G. Moreover, we prove that in some special cases this bound is sharp.
    Źródło:
    Opuscula Mathematica; 2017, 37, 4; 567-575
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The Turán Number for 4 · Sℓ
    Autorzy:
    Li, Sha-Sha
    Yin, Jian-Hua
    Li, Jia-Yun
    Powiązania:
    https://bibliotekanauki.pl/articles/32387981.pdf
    Data publikacji:
    2022-11-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Turán number
    disjoint copies
    k · S ℓ
    Opis:
    The Turán number of a graph H, denoted by ex(n, H), is the maximum number of edges of an n-vertex simple graph having no H as a subgraph. Let Sℓ denote the star on ℓ + 1 vertices, and let k · Sℓ denote k disjoint copies of Sℓ. Erdős and Gallai determined the value ex(n, k · S1) for all positive integers k and n. Yuan and Zhang determined the value ex(n, k · S2) and characterized all extremal graphs for all positive integers k and n. Recently, Lan et al. determined the value ex(n, 2 · S3) for all positive integers n, and Li and Yin determined the values ex(n, k · Sℓ) for k = 2, 3 and all positive integers ℓ and n. In this paper, we further determine the value ex(n, 4 · Sℓ) for all positive integers ℓ and almost all n, improving one of the results of Lidický et al.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2022, 42, 4; 1119-1128
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Asymptotically isometric and isometric copies of \(\ell_1\) in some Banach function lattices
    Autorzy:
    Kamińska, Anna
    ~Mastyło, Mieczysław
    Powiązania:
    https://bibliotekanauki.pl/articles/1912874.pdf
    Data publikacji:
    2013
    Wydawca:
    Polskie Towarzystwo Matematyczne
    Tematy:
    Caldern-Lozanovskii spaces
    Orlicz-Lorentz spaces
    Orlicz spaces
    Lorentz spaces
    Marcinkiewicz spaces
    isometric copies of \(\ell_1^{(n)}\) and \(\ell_1\)
    asymptotically isometric copies of \(\ell_1\)
    fixed point property
    Opis:
    We identify the class of Caldern-Lozanovskii spaces that do not contain an asymptotically isometric copy of \(\ell_1\), and consequently we obtain the corresponding characterizations in the classes of Orlicz-Lorentz and Orlicz spaces equipped with the Luxemburg norm. We also give a~complete description of order continuous Orlicz-Lorentz spaces which contain (order) isometric copies of \(\ell_1^{(n)}\) for each integer \(n \geq 2\).~As an application we provide necessary and sufficient conditions for order continuous Orlicz-Lorentz spaces to contain an (order) isometric copy of \(\ell_1\).~In particular we give criteria in Orlicz and Lorentz spaces for (order) isometric containment of \(\ell_1^{(n)}\) and \(\ell_1\).~The results are applied to obtain the~description of universal Orlicz-Lorentz spaces for all two-dimensional normed spaces.
    Źródło:
    Commentationes Mathematicae; 2013, 53, 2; 383-400
    0373-8299
    Pojawia się w:
    Commentationes Mathematicae
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On Total H-Irregularity Strength of the Disjoint Union of Graphs
    Autorzy:
    Ashraf, Faraha
    López, Susana Clara
    Muntaner-Batle, Francesc Antoni
    Oshima, Akito
    Bača, Martin
    Semaničová-Feňovčíková, Andrea
    Powiązania:
    https://bibliotekanauki.pl/articles/32083832.pdf
    Data publikacji:
    2020-02-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    H -covering
    H -irregular labeling
    total H -irregularity strength
    copies of graphs
    union of graphs
    Opis:
    A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and edges belonging to H. The total k-labeling is called the H-irregular total k-labeling of a graph G admitting an H-covering if all subgraphs of G isomorphic to H have distinct weights. The total H-irregularity strength of a graph G is the smallest integer k such that G has an H-irregular total k-labeling. In this paper, we estimate lower and upper bounds on the total H-irregularity strength for the disjoint union of multiple copies of a graph and the disjoint union of two non-isomorphic graphs. We also prove the sharpness of the upper bounds.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2020, 40, 1; 181-194
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Copies of labour contracts in Roman and Late Antique Egypt: Institutions and society
    Autorzy:
    Freu, Christel
    Powiązania:
    https://bibliotekanauki.pl/articles/1195396.pdf
    Data publikacji:
    2018
    Wydawca:
    Fundacja im. Rafała Taubenschlaga
    Tematy:
    labour contracts
    loans
    liturgical work
    chirographs
    copies
    notaries (High Empire)
    ταβελλίων (Late Antiquity)
    παραμοναί
    προχρεία
    ἀντίγραφον
    ἴσον
    Opis:
    The article explores changes in writing and copying labour contracts from the first centuries of the Roman rule in Egypt to Late Antiquity. During the first centuries, some labour contracts – antichretic loans and wet nurses contracts – were notarial documents registered in public archives and copied at least twice. Labour contracts written in chirographic form, whose number grew from the second century on, were not necessarily registered, in which case the parties had to choose whether they wanted to make a second private copy. In Late Antiquity, chirographs drafted by private scribes and authenticated by notaries (ταβελλίωνες) were the norm; in the Oxyrhynchite nome, a reform obliged the scribes to notify whether the text was copied once or more. This new habit allows us to see that only work contracts relat- ed to liturgies (fiscal collection, and public postal or transport duties) were copied twice, as was already the norm in the Oxyrhynchites in the third century. All other private work agreements and antichretic loans were issued only once, to the benefit of the employer/creditor.
    Źródło:
    The Journal of Juristic Papyrology; 2018, 48; 103-140
    0075-4277
    Pojawia się w:
    The Journal of Juristic Papyrology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Fréchet spaces of continuous vector-valued functions: Complementability in dual Fréchet spaces and injectivity
    Autorzy:
    Domański, P.
    Drewnowski, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/1293180.pdf
    Data publikacji:
    1992
    Wydawca:
    Polska Akademia Nauk. Instytut Matematyczny PAN
    Tematy:
    Fréchet spaces of (weakly, weak*) continuous vector-valued functions injective Fréchet spaces
    spaces complemented in dual Fréchet spaces
    complemented copies of $c_0$
    Josefson-Nissenzweig theorem
    Opis:
    Fréchet spaces of strongly, weakly and weak*-continuous Fréchet space valued functions are considered. Complete solutions are given to the problems of their injectivity or embeddability as complemented subspaces in dual Fréchet spaces.
    Źródło:
    Studia Mathematica; 1992, 102, 3; 257-267
    0039-3223
    Pojawia się w:
    Studia Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-7 z 7

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies