Informacja

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

Wyszukujesz frazę "3-uniform hypergraph" wg kryterium: Temat


Wyświetlanie 1-5 z 5
Tytuł:
The existence of bipartite almost self-complementary 3-uniform hypergraphs
Autorzy:
Kamble, L. N.
Deshpande, C. M.
Athawale, B. P.
Powiązania:
https://bibliotekanauki.pl/articles/29519545.pdf
Data publikacji:
2023
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
almost self-complementary 3-uniform hypergraph
bipartite hypergraph
bipartite self-complementary 3-uniform hypergraph
bipartite almost self-complementary 3-uniform hypergraph
Opis:
An almost self-complementary 3-uniform hypergraph on n vertices exists if and only if n is congruent to 3 modulo 4. A hypergraph $ H $ with vertex set $ V $ and edge set $ E $ is called bipartite if $ V $ can be partitioned into two subsets $ V_1 $ and $ V_2 $ such that $ e ∩ V_1 ≠ ∅ $ and $e ∩ V_2 ≠ ∅ $ for any $ e ∈ E $. A bipartite self-complementary 3-uniform hypergraph $ H $ with partition $ (V_1, V_2) $ of the vertex set $ V $ such that $ |V_1| = m $ and $ |V_2| = n $ exists if and only if either (i) $ m = n $ or (ii) $ m ≠ n $ and either $ m $ or $ n $ is congruent to 0 modulo 4 or (iii) $ m ≠ n $ and both $ m $ and $ n $ are congruent to 1 or 2 modulo 4. In this paper we define a bipartite almost self-complementary 3-uniform hypergraph $ H $ with partition $ (V_1, V_2) $ of a vertex set $ V $ such that $ |V_1| = m $ and $ |V_2| = n $ and find the conditions on $ m $ and $ n $ for a bipartite 3-uniform hypergraph $ H $ to be almost self-complementary. We also prove the existence of bi-regular bipartite almost self-complementary 3-uniform hypergraphs.
Źródło:
Opuscula Mathematica; 2023, 43, 5; 663-673
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Families of triples with high minimum degree are Hamiltonian
Autorzy:
Rödl, Vojtech
Ruciński, Andrzej
Powiązania:
https://bibliotekanauki.pl/articles/30148238.pdf
Data publikacji:
2014-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
3-uniform hypergraph
Hamilton cycle
minimum vertex degree
Opis:
In this paper we show that every family of triples, that is, a 3-uniform hypergraph, with minimum degree at least $$(\frac{5−√5}{3} + γ)\binom{n−1}{2}$$ contains a tight Hamiltonian cycle.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 2; 361-381
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A hierarchy of maximal intersecting triple systems
Autorzy:
Polcyn, J.
Ruciński, A.
Powiązania:
https://bibliotekanauki.pl/articles/254859.pdf
Data publikacji:
2017
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
maximal intersecting family
3-uniform hypergraph
triple system
Opis:
We reach beyond the celebrated theorems of Erdös-Ko-Rado and Hilton-Milner, and a recent theorem of Han-Kohayakawa, and determine all maximal intersecting triples systems. It turns out that for each n ≥ 7 there are exactly 15 pairwise non-isomorphic such systems (and 13 for n = 6). We present our result in terms of a hierarchy of Turan numbers [formula], s ≥ 1, where [formula] is a pair of disjoint triples. Moreover, owing to our unified approach, we provide short proofs of the above mentioned results (for triple systems only). The triangle C3 is defined as C3 = {{x1,y3,x2}, {x1,y2,x3}, {x2, y1,x3}}. Along the way we show that the largest intersecting triple system H on n ≥ 6 vertices, which is not a star and is triangle-free, consists of max{10, n} triples. This facilitates our main proof's philosophy which is to assume that H contains a copy of the triangle and analyze how the remaining edges of H intersect that copy.
Źródło:
Opuscula Mathematica; 2017, 37, 4; 597-608
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Almost Self-Complementary 3-Uniform Hypergraphs
Autorzy:
Kamble, Lata N.
Deshpande, Charusheela M.
Bam, Bhagyashree Y.
Powiązania:
https://bibliotekanauki.pl/articles/31342164.pdf
Data publikacji:
2017-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
uniform hypergraph
self-complementary hypergraph
almost complete 3-uniform hypergraph
almost self-complementary hypergraph
quasi regular hypergraph
Opis:
It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is congruent to 0, 1 or 2 modulo 4. In this paper we define an almost self-complementary 3-uniform hypergraph on n vertices and prove that it exists if and only if n is congruent to 3 modulo 4. The structure of corresponding complementing permutation is also analyzed. Further, we prove that there does not exist a regular almost self-complementary 3-uniform hypergraph on n vertices where n is congruent to 3 modulo 4, and it is proved that there exist a quasi regular almost self-complementary 3-uniform hypergraph on n vertices where n is congruent to 3 modulo 4.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 1; 131-140
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards the boundary between easy and hard control problems in multicast Clos networks
Autorzy:
Obszarski, P.
Jastrzębski, A.
Kubale, M.
Powiązania:
https://bibliotekanauki.pl/articles/200819.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Clos-network
2-cast call
hypergraph edge coloring
rearrageable network
nonblocking network
NP-completeness
3-uniform hypergraph
sieci
połączenie sieciowe
problem sieciowy
Opis:
In this article we study 3-stage Clos networks with multicast calls in general and 2-cast calls, in particular. We investigate various sizes of input and output switches and discuss some routing problems involved in blocking states. To express our results in a formal way we introduce a model of hypergraph edge-coloring. A new class of bipartite hypergraphs corresponding to Clos networks is studied. We identify some polynomially solvable instances as well as a number of NP-complete cases. Our results warn of possible troubles arising in the control of Clos networks even if they are composed of small-size switches in outer stages. This is in sharp contrast to classical unicast Clos networks for which all the control problems are polynomially solvable.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 3; 739-744
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    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