#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2011

2018

- This year (1)
- Last 5 years (7)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Janusz Dybizbanski, Tomasz Dzido
- Graphs and Combinatorics
- 2014

For given graphs G1 and G2, the Ramsey number R(G1, G2) is the least integer n such that every 2-coloring of the edges of Kn contains a subgraph isomorphic to G1 in the first color or a subgraphâ€¦ (More)

- Janusz Dybizbanski, Andrzej Szepietowski
- ArXiv
- 2018

Szepietowski [A. Szepietowski, Hamiltonian cycles in hypercubes with 2nâˆ’4 faulty edges, Information Sciences, 215 (2012) 75â€“82] observed that the hypercube Qn is not Hamiltonian if it contains a trapâ€¦ (More)

- Janusz Dybizbanski, Tomasz Dzido, Stanislaw P. Radziszowski
- Ars Comb.
- 2015

The Zarankiewicz number z(m,n; s, t) is the maximum number of edges in a subgraph of Km,n that does not contain Ks,t as a subgraph. The bipartite Ramsey number b(n1, Â· Â· Â· , nk) is the least positiveâ€¦ (More)

- Janusz Dybizbanski, Anna Nenca
- Inf. Process. Lett.
- 2012

Article history: Received 7 October 2010 Received in revised form 27 October 2011 Accepted 31 October 2011 Available online 9 November 2011 Communicated by B. Doerr

- Janusz Dybizbanski
- Electr. J. Comb.
- 2012

A subsequence of the sequence (1, 2, ..., n) is called a 3-AP -free sequence if it does not contain any three term arithmetic progression. By r(n) we denote the length of the longest such 3-AP -freeâ€¦ (More)

- Tanbir Ahmed, Janusz Dybizbanski, Hunter S. Snevily
- Electr. J. Comb.
- 2013

In this paper, we are concerned with calculating r(k, n), the length of the longest k-Ap free subsequences in 1, 2, . . . , n. We prove the basic inequality r(k, n) 6 n âˆ’ bm/2c, where n = m(k âˆ’ 1) +â€¦ (More)

- Janusz Dybizbanski, Tomasz Dzido
- Electr. J. Comb.
- 2011

We will prove that R(C4, C4,K4 âˆ’ e) = 16. This fills one of the gaps in the tables presented in a 1996 paper by Arste et al. Moreover by using computer methods we improve lower and upper bounds forâ€¦ (More)

- Janusz Dybizbanski, Andrzej Szepietowski
- Inf. Process. Lett.
- 2014

Oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H . The oriented chromatic number of an unoriented graph G is theâ€¦ (More)

- Luis Boza, Janusz Dybizbanski, Tomasz Dzido
- Electr. J. Comb.
- 2012

For given graphs H1, H2, H3, the 3-color Ramsey number R(H1, H2, H3) is the smallest integer n such that if we arbitrarily color the edges of the complete graph of order n with 3 colors, then itâ€¦ (More)

- Janusz Dybizbanski, Andrzej Szepietowski
- Inf. Sci.
- 2017