Search
Didn't find any results in this catalog!
But we have some results in other catalogs.Filters
total: 7643
-
Catalog
- Publications 2873 available results
- Journals 6 available results
- Conferences 1 available results
- People 119 available results
- Inventions 10 available results
- Projects 4 available results
- Laboratories 6 available results
- Research Teams 7 available results
- Research Equipment 40 available results
- e-Learning Courses 1159 available results
- Events 21 available results
- Open Research Data 3397 available results
displaying 1000 best results Help
Search results for: 3-UNIFORM HYPERGRAPH
-
Edge-coloring of 3-uniform hypergraphs
PublicationWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
Equitable coloring of hypergraphs
PublicationA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
Independence in uniform linear triangle-free hypergraphs
PublicationThe independence number a(H) of a hypergraph H is the maximum cardinality of a set of vertices of H that does not contain an edge of H. Generalizing Shearer’s classical lower bound on the independence number of triangle-free graphs Shearer (1991), and considerably improving recent results of Li and Zang (2006) and Chishti et al. (2014), we show a new lower bound for a(H) for an r-uniform linear triangle-free hypergraph H with r>=2.
-
Weighted 2-sections and hypergraph reconstruction
PublicationIn the paper we introduce the notion of weighted 2-sections of hypergraphs with integer weights and study the following hypergraph reconstruction problems: (1) Given a weighted graph , is there a hypergraph H such that is its weighted 2-section? (2) Given a weighted 2-section , find a hypergraph H such that is its weighted 2-section. We show that (1) is NP-hard even if G is a complete graph or integer weights w does not exceed...
-
Karolina Lademann mgr
PeopleCurriculum vitae
-
Karolina Lademann Mgr
People -
On Symmetry of Uniform and Preferential Attachment Graphs
PublicationMotivated by the problem of graph structure compression under realistic source models, we study the symmetry behavior of preferential and uniform attachment graphs. These are two dynamic models of network growth in which new nodes attach to a constant number m of existing ones according to some attachment scheme. We prove symmetry results for m=1 and 2 , and we conjecture that for m≥3 , both models yield asymmetry with high...
-
Electron collision with B(CD3)3 molecules
PublicationArtykuł prezentuje całkowite przekroje czynne na rozpraszanie elektronów na drobinach B(CD3)3 zmierzone dla niskich i średnich energii zderzenia. Wyniki porównano z elastycznymi i jonizacyjnymi przekrojami czynnymi obliczonymi dla drobiny B(CD3)3 dla średnich energii zderzenia. Porównano i przedyskutowano przekroje czynne dla drobin zawierających bor.
-
Influence of transglutaminase or 1-ethyl-3-(3-dimethylaminopropyl) carbodiimide (EDC) on the properties of fish-skin gelatin films
PublicationBadano wpływ sieciowania żelatyny przy użyciu transglutaminazy (TG) lub EDC na rozpuszczalność oraz mechaniczne i barierowe właściwości wytworzonych folii. Rozpuszczalność sieciowanych enzymatycznie folii w buforach o pH 3 i 6 obniżyła się ze 100% do 30%, a folii modyfikowanych TG w obecności ditiotreitolu lub cysteiny, odpowiednio, do 5 i 15%. Rozpuszczalność folii modyfikowanych EDC wynosiła 10%. Sieciowanie enzymatyczne nie...
-
Collisions of electrons with trimethylamine N(CH3)3 molecules
PublicationPrzedstawiono całkowite przekroje czynne na rozpraszanie elektronów na drobinach N(CH3)3, zmierzone dla niskich i średnich energii zderzenia. Wyniki porównano z elastycznymi i jonizacyjnymi przekrojami czynnymi, obliczonymi dla tej drobiny, dla średnich energii zderzenia. Porównano i przedyskutowano przekroje czynne dla drobin zawierających azot jako atom centralny.