# Search results for: Adam Idzik

Journal of Graph Theory > 94 > 2 > 175 - 191

*isometric Ramsey number*$\mathrm{IR}\left(\overrightarrow{H}\right)$ of a family $\overrightarrow{H}$ of digraphs is the smallest number of vertices in a graph $G$ such that any orientation of the edges of $G$ contains every member of $\overrightarrow{H}$ in the distance‐preserving way. We observe that the isometric Ramsey number of a finite family of finite acyclic digraphs is always finite, and present some bounds in special cases. For example, we show that the isometric...

Fixed Point Theory and Applications > 2012 > 2012 > 1 > 1-9

Fixed Point Theory and Applications > 2009 > 2010 > 1 > 1-7

Discussiones Mathematicae Graph Theory > 2006 > 26 > 3 > 439-338

Discussiones Mathematicae Graph Theory > 2005 > 25 > 1-2 > 95-102

Economic Theory > 2002 > 19 > 4 > 833-838

Discrete Mathematics > 2001 > 235 > 1-3 > 301-306

Journal of Combinatorial Theory, Series A > 2001 > 93 > 2 > 281-291

^{1/t}n

^{1−1/t}elements. The same holds for balanced families, which is a generalization of the regularity. The estimate is asymptotically sharp.

Discrete Mathematics > 1999 > 194 > 1-3 > 39-58

Graphs and Combinatorics > 1999 > 15 > 2 > 129-136

Discussiones Mathematicae, Differential Inclusions, Control and Optimization > 1995 > 15 > 2 > 187-190

Mathematica Applicanda > 1979 > 7 > 14