Nalaganje...

The hypergraph regularity method and its applications

Szemerédi's regularity lemma asserts that every graph can be decomposed into relatively few random-like subgraphs. This random-like behavior enables one to find and enumerate subgraphs of a given isomorphism type, yielding the so-called counting lemma for graphs. The combined application of the...

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
Main Authors: Rödl, V., Nagle, B., Skokan, J., Schacht, M., Kohayakawa, Y.
Format: Artigo
Jezik:Inglês
Izdano: National Academy of Sciences 2005
Teme:
Online dostop:https://ncbi.nlm.nih.gov/pmc/articles/PMC1149431/
https://ncbi.nlm.nih.gov/pubmed/15919821
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.0502771102
Oznake: Označite
Brez oznak, prvi označite!