#### Filter Results:

#### Publication Year

2014

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Halina Bielak, Kamil Powroznik
- 2015 Federated Conference on Computer Science and…
- 2015

Let H = (V, Σ) be a 3-uniform linear hypergraph with one hypercycle C<sub>3</sub>. We consider a blow-up hypergraph B[H]. We are interested in the following problem. We have to decide whether there exists a blow-up hypergraph B[H] of the hypergraph H, with hyperedge densities satisfying special conditions, such that the hypergraph H appears in a… (More)

- Halina Bielak, Kamil Powroznik
- FedCSIS
- 2015

—Let H = (V, E) be a 3-uniform linear hypergraph with one hypercycle C3. We consider a blow-up hypergraph B[H]. We are interested in the following problem. We have to decide whether there exists a blow-up hypergraph B[H] of the hypergraph H, with hyperedge densities satisfying special conditions, such that the hypergraph H appears in a blow-up hypergraph as… (More)

- Halina Bielak, Kamil Powroznik
- FedCSIS
- 2014

—Let H = (V (H), E(H)) be a simple connected graph of order n with the vertex set V (H) and the edge set E(H). We consider a blow-up graph G[H]. We are interested in the following problem. We have to decide whether there exists a blow-up graph G[H], with edge densities satisfying special conditions (homogeneous or inhomogeneous), such that the graph H does… (More)

- Halina Bielak, Kamil Powroznik
- 2014 Federated Conference on Computer Science and…
- 2014

Let H = (V(H),E(H)) be a simple connected graph of order n with the vertex set V (H) and the edge set E(H). We consider a blow-up graph G[H]. We are interested in the following problem. We have to decide whether there exists a blow-up graph G[H], with edge densities satisfying special conditions (homogeneous or inhomogeneous), such that the graph H does not… (More)

- ‹
- 1
- ›