نتایج جستجو برای: unavoidable

تعداد نتایج: 6817  

Journal: :European Journal of Combinatorics 2014

Journal: :Information and Computation 2002

Journal: :Journal of Combinatorial Theory, Series B 1979

Journal: :RAIRO - Theoretical Informatics and Applications 1995

Journal: :Israel Journal of Mathematics 2021

We prove that the symmetrized deleted join SymmDelJoin( $$\mathcal{K}$$ ) of a “balanced family” = ?Ki? =1 collectively r-unavoidable subcomplexes 2[m] is (m?r?1)-connected. As consequence we obtain Tverberg-Van Kampen-Flores type result which more conceptual and general than previously known results. Already case r 2 this seems to be new as an extension classical Van theorem. The main tool use...

Journal: :Journal of Graph Theory 1988
Lou Caccetta Paul Erdös K. Vijayan

Let `,(n, m) denote the class of simple graphs on n vertices and m edges and let G C `6(n, m) . There are many results in graph theory giving conditions under which G contains certain types of subgraphs, such as cycles of given lengths, complete graphs, etc . For example, Turan's theorem gives a sufficient condition for G to contain a K,,„ in terms of the number of edges in G . In this paper we...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید