On set intersection representations of graphs (Q3633007): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1002/jgt.20367 / rank
Normal rank
 
Property / author
 
Property / author: Stasys P. Jukna / rank
Normal rank
 
Property / author
 
Property / author: Stasys P. Jukna / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.20367 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4214604286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering graphs by the minimum number of equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to the rank-coloring conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Circuits over $\operatorname{GF}(2)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Onp-intersection representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set intersection representations for almost all graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of small dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Representation of a Graph by Set Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a graph by complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the edges of a random graph by cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Addressing Problem for Loop Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of the middle bit of a \(\#\)P function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graph Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covering graphs by complete bipartite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph complexity and slice functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rank vs. communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound for the Chromatic Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial-algebraic problems from complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ``log rank''-conjecture in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The log-rank conjecture and low degree polynomials / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/JGT.20367 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:07, 21 December 2024

scientific article
Language Label Description Also known as
English
On set intersection representations of graphs
scientific article

    Statements

    On set intersection representations of graphs (English)
    0 references
    16 June 2009
    0 references
    intersection graphs
    0 references
    edge clique covering number
    0 references
    bicliques
    0 references
    Hadamard graphs
    0 references
    sylvester graphs
    0 references
    Ramsey graphs
    0 references
    Boolean functions
    0 references
    depth-2 circuits
    0 references
    0 references
    0 references
    0 references

    Identifiers