The following pages link to Andrzej Grzesik (Q473102):
Displayed 37 items.
- Finitely forcible graphons and permutons (Q473103) (← links)
- On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament (Q528999) (← links)
- On the maximum number of five-cycles in a triangle-free graph (Q713972) (← links)
- Cycles of length three and four in tournaments (Q778712) (← links)
- Extremal graph theory and finite forcibility (Q1689971) (← links)
- Indicated coloring of graphs (Q1761467) (← links)
- Exact hyperplane covers for subsets of the hypercube (Q2037567) (← links)
- Packing and covering directed triangles asymptotically (Q2065998) (← links)
- Cycles of a given length in tournaments (Q2099412) (← links)
- On the inducibility of oriented graphs on four vertices (Q2138968) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- Minimum number of edges that occur in odd cycles (Q2312602) (← links)
- The Turán number of blow-ups of trees (Q2673488) (← links)
- Subgraph densities in \(K_r\)-free graphs (Q2699640) (← links)
- Elusive extremal graphs (Q3389178) (← links)
- Optimal‐size clique transversals in chordal graphs (Q4646950) (← links)
- Analytic representations of large graphs (Q5149167) (← links)
- Polynomial-time algorithm for Maximum Weight Independent Set on <i>P</i><sub>6</sub>-free graphs (Q5236261) (← links)
- Avoider-Enforcer star games (Q5249233) (← links)
- From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path (Q5251623) (← links)
- (Q5419993) (← links)
- On tripartite common graphs (Q5886347) (← links)
- Tuza's Conjecture for Threshold Graphs (Q6045403) (← links)
- On the maximum number of odd cycles in graphs without smaller odd cycles (Q6056808) (← links)
- The maximum number of paths of length three in a planar graph (Q6057639) (← links)
- Polynomial-time Algorithm for Maximum Weight Independent Set on <i>P</i> <sub>6</sub> -free Graphs (Q6058231) (← links)
- Quasirandom-Forcing Orientations of Cycles (Q6071821) (← links)
- Degree Conditions Forcing Directed Cycles (Q6097876) (← links)
- Maximal edge colorings of graphs (Q6181990) (← links)
- Graphs without a Rainbow Path of Length 3 (Q6188520) (← links)
- Densities of 3-vertex graphs (Q6278415) (← links)
- Subgraph densities in $K_r$-free graphs (Q6400274) (← links)
- Forcing Generalized Quasirandom Graphs Efficiently (Q6428714) (← links)
- Tur\'an problems for oriented graphs (Q6438685) (← links)
- Directed graphs without rainbow triangles (Q6446088) (← links)
- On triangle-free graphs maximizing embeddings of bipartite graphs (Q6452243) (← links)
- The double Hall property and cycle covers in bipartite graphs (Q6453802) (← links)