The Turán density of the hypergraph .
Füredi, Zoltán, Pikhurko, Oleg, Simonovits, Miklós (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Extremal problems for -partite and -colorable hypergraphs.”
The Turán density of the hypergraph .
Dense -free graphs are almost -partite.
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Upper and lower bounds for .
Xu, Xiaodong, Luo, Haipeng, Shao, Zehui (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edit distance and its computation.
Balogh, József, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The order of monochromatic subgraphs with a given minimum degree.
Caro, Yair, Yuster, Raphael (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Uniquely -colorable and chromatically equivalent graphs.
Chao, Chong-Yun (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Acyclic, star and oriented colourings of graph subdivisions.
Wood, David R. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Chromatic index of finite and infinite graphs
Juraj Bosák (1972)
Czechoslovak Mathematical Journal
Similarity:
-free graphs of large minimum degree.
Alon, Noga, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
H.P. Patil, R. Pandiya Raj (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The technique of counting cliques in networks is a natural problem. In this paper, we develop certain results on counting of triangles for the total graph of the Mycielski graph or central graph of star as well as completegraph families. Moreover, we discuss the upper bounds for the number of triangles in the Mycielski and other well known transformations of graphs. Finally, it is shown that the achromatic number and edge-covering number of the transformations mentioned above are equated. ...