Kalai's conjecture in \(r\)-partite \(r\)-graphs (Q6181994): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Exact solution of some Turán-type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree containment and degree conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs Not Containing a Tight Tree with a Bounded Trunk / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on traces of set families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight cycles and regular slices in dense hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaxCut in ${\bm H)$-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for paths in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variation of the Erdős-Sós conjecture in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extremal Properties of Bipartite Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coloring graphs to maximize the proportion of multicolored k-edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph cuts above the average / rank
 
Normal rank

Revision as of 19:46, 23 August 2024

scientific article; zbMATH DE number 7793124
Language Label Description Also known as
English
Kalai's conjecture in \(r\)-partite \(r\)-graphs
scientific article; zbMATH DE number 7793124

    Statements

    Identifiers

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