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

Publisher： Elsevier

ISSN： 0095-8956

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

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

Related content

The Number of Monochromatic Schur Triples

By Schoen T.

European Journal of Combinatorics, Vol. 20, Iss. 8, 1999-11 ,pp. : 855-866

Elsevier

Access to resources Recommend Favorite

The Ratio of the Perimeter and the Area of Unions of Copies of a Fixed Set

By Gyenes Z.

Discrete & Computational Geometry, Vol. 45, Iss. 3, 2011-04 ,pp. : 400-409

Springer Publishing Company

Access to resources Recommend Favorite

On the Maximum Number of Spanning Copies of an Orientation in a Tournament

Combinatorics, Probability & Computing, Vol. 26, Iss. 5, 2017-09 ,pp. : 775-796

Cambridge University Press

Access to resources Recommend Favorite

The Geodetic Number of an Oriented Graph

By Chartrand G. Zhang P.

European Journal of Combinatorics, Vol. 21, Iss. 2, 2000-02 ,pp. : 181-189

Elsevier

Access to resources Recommend Favorite

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