Independent sets in hypergraphs (Q5247664): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q105584049 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1204.6530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting sum-free sets in abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refinement of the Cameron-Erdős conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal subgraphs of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of graphs without forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typical structure of graphs without given excluded subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typical structure of sparse $K_{r+1}$-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all triple systems with independent neighborhoods are semi-bipartite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all triangle-free triple systems are tripartite / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of \(K_{m,m}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of <i>K</i> <sub> <i>s,t</i> </sub> -free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial extensions of van der Waerden’s and Szemerédi’s theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial theorems in sparse random sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the KŁR conjecture in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturated graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the graph removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large triangle-free subgraphs in graphs without \(K_ 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey properties of random discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Ramsey graphs for the four-cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Triple Systems with Independent Neighbourhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triple Systems Not Containing a Fano Configuration / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ergodic Szemerédi theorem for commuting transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small subsets inherit sparse \(\varepsilon\)-regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K_4\)-free subgraphs of random graphs revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: K<sub>5</sub>‐free subgraphs of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph regularity and the multidimensional Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán's extremal problem in random graphs: Forbidding even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán's extremal problem in random graphs: Forbidding odd cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability theorems for cancellative hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turán number of the Fano plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Szemerédi’s Regularity Lemma for Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4361714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic progressions of length three in subsets of a random set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(K^ 4\)-free subgraphs of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular pairs in sparse random graphs I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turn Theorem for Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on probability thresholds for asymmetric Ramsey properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On triangle-free random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric Ramsey properties of random graphs involving cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: For which densities are random triangle-free graphs almost surely bipartite? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Functions for Ramsey Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the regularity lemma for uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability results for random discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph containers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal results for random discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Szemerédi's Regularity Lemma for Matrices and Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán's theorem in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of integers containing k elements in arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Sets of Positive Density / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:55, 9 July 2024

scientific article; zbMATH DE number 6430694
Language Label Description Also known as
English
Independent sets in hypergraphs
scientific article; zbMATH DE number 6430694

    Statements

    Independent sets in hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2015
    0 references
    sparse random setting
    0 references
    sparse random sets
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references