On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings

Author： Kostochka A.V.   Woodall D.R.  

Publisher： Elsevier

ISSN： 0195-6698

Source： European Journal of Combinatorics, Vol.21, Iss.2, 2000-02, pp. : 249-255

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges

By Ackerman Eyal  

Discrete & Computational Geometry, Vol. 41, Iss. 3, 2009-04 ,pp. : 365-375

Springer Publishing Company

Access to resources Recommend Favorite

On the number of edges not covered by monochromatic copies of a fixed graph

By Keevash P.   Sudakov B.  

Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. : 41-53

Elsevier

Access to resources Recommend Favorite

New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn

By Aichholzer Oswin   Garcia Jesus   Orden David   Ramos Pedro  

Discrete & Computational Geometry, Vol. 38, Iss. 1, 2007-07 ,pp. : 1-14

Springer Publishing Company

Access to resources Recommend Favorite

The Critical Value of the Contact Process with Added and Removed Edges

By Jung Paul  

Journal of Theoretical Probability, Vol. 18, Iss. 4, 2005-10 ,pp. : 949-955

Springer Publishing Company

Access to resources Recommend Favorite

The critical number of a variable in a function

By  

The Journal of Symbolic Logic, Vol. 59, Iss. 4, 1994-12 ,pp. : 1228-1244

Cambridge University Press

Access to resources Recommend Favorite